Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
- 19 January 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 80 (2) , 371-380
- https://doi.org/10.1016/0377-2217(93)e0160-y
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up timesEuropean Journal of Operational Research, 1991
- On the Complexity of Scheduling with Batch Setup TimesOperations Research, 1989
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover CostsSIAM Journal on Computing, 1978