A sequencing problem with family setup times

Discrete Applied Mathematics

Volumn 66, Issue 2, 1996, Pages 161-183

  Zdrzałka, Stanisław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Batching; Branch and bound algorithm; Setup times; Single machine scheduling; Worst case analysis

Indexed keywords

EID: 0010771889     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00139-5     Document Type: Article

References (18)

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job-shop scheduling, Management Sci. 34 (1988) 391-401.
2. J. Carlier, The one-machine sequencing problem, European J. Oper. Res. 11 (1982) 42-47.
3. J. Grabowski, E. Nowicki and S. Zdrzałka, A block approach for single-machine scheduling with release dates and due dates, European J. Oper. Res. 26 (1986) 278-285.
4. L.H. Hall and D.B. Shmoys, Jackson's rule for single-machine scheduling: Making a good heuristic better, Math. Oper. Res. 17 (1992) 22-35.
5. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Mgmt. Sci. Research Project, UCLA (1955).
6. H. Kise, T. Ibaraki and H. Mine, Approximate algorithms for the one-machine maximum lateness scheduling problem ready times, Technical Report, Department of Applied Mathematics and Physics, Kyoto University, Kyoto (1978).
7. B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness on one machine: Computational experience and some applications, Statist. Neerlandica 30 (1976) 25-41.
8. J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 1 (1977) 343-363.
9. C.L. Monma and C.N. Potts, On the complexity of scheduling with batch set-up times, Oper. Res. 37 (1989) 798-804.
10. E. Nowicki and S. Zdrzalka, A note on minimizing maximum lateness in a one-machine sequencing problem with release dates, European J. Oper. Res. 23 (1986) 266-267.
11. C.N. Potts, Analysis of heuristic for one machine sequencing with release dates and delivery times, Oper. Res. 28 (1980) 1436-1441.
12. C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, J. Oper. Res. Soc. 43 (1992) 395-406.
13. L. Schrage, Obtaining optimal solutions to resource constrained network scheduling problems, unpublished manuscript (1971).
14. Y. Sekiguchi, Optimal schedule in a GT-type flow-shop under series-parallel precedence constraints, J. Oper. Res. Soc. Japan 26 (1983) 226-251.
15. R. Uzsoy, C.Y. Lee and L.A. Martin-Vega, Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine, Naval Res. Logist. 39 (1992) 369-388.
16. S. Zdrzałka and J. Grabowski, An algorithm for single machine sequencing with release dates to minimize maximum cost, Discrete Appl. Math. 23 (1989) 73-89.
17. S. Zdrzałka, Approximation algorithms for single machine sequencing with delivery times and unit batch set-up times, European J. Oper. Res. 51 (1991) 199-209.
18. S. Zdrzałka, Preemptive scheduling with release dates, delivery times and sequence independent setup times, European J. Oper. Res. 76 (1994) 60-71.