Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- 27 March 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 51 (2) , 199-209
- https://doi.org/10.1016/0377-2217(91)90250-y
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- On the Complexity of Scheduling with Batch Setup TimesOperations Research, 1989
- Sequencing with Series-Parallel Precedence ConstraintsMathematics of Operations Research, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover CostsSIAM Journal on Computing, 1978