article · RAIRO. Operations research
In this note we introduce new characterizations for the optimal solution of the identical coupled tasks scheduling problem. We also develop three lower bounds and formulate useful observations about the choice of the test instances.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1051/ro/2023014
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
