A better algorithm for sequencing with release and delivery times on identical machines
- 30 September 2003
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 48 (2), 273-293
- https://doi.org/10.1016/s0196-6774(03)00072-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Concurrent operations can be parallelized in scheduling multiprocessor job shopJournal of Scheduling, 2002
- Scheduling Equal-Length Jobs with Delivery times on Identical ProcessorsInternational Journal of Computer Mathematics, 2002
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length JobsSIAM Journal on Computing, 1989
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1983
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973