Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- 1 June 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 29 (3) , 298-306
- https://doi.org/10.1016/0377-2217(87)90243-8
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum LatenessJournal of the Operational Research Society, 1983
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resourcesEuropean Journal of Operational Research, 1981
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery TimesOperations Research, 1980
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Ordonnancements à contraintes disjonctivesRairo-Operations Research, 1978
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973