A block approach for single-machine scheduling with release dates and due dates
- 1 August 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 26 (2) , 278-285
- https://doi.org/10.1016/0377-2217(86)90191-8
Abstract
No abstract availableKeywords
This publication has 9 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
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery TimesOperations Research, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- 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