An algorithm for single machine sequencing with release dates to minimize maximum cost
- 30 April 1989
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 23 (1), 73-89
- https://doi.org/10.1016/0166-218x(89)90036-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- A note on minimizing maximum lateness in a one-machine sequencing problem with release datesEuropean Journal of Operational Research, 1986
- 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 BV ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier BV ,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
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973