Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time

Annals of Operations Research

Volumn 83, Issue , 1998, Pages 59-76

  Crauwels, H A J ^a   Hariri, A M A ^b   Potts, C N ^c   Van Wassenhove, L N ^d  

^a Sint Katelijne Waver   (Belgium)

^b KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

^c UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^d INSEAD   (France)

Author keywords

Batches; Branch and bound; Lagrangian relaxation; Scheduling; Set up time; Single machine

Indexed keywords

EID: 0032343614     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018920416308     Document Type: Article

References (14)

1. B.-H. Ahn and J.-H. Hyun, Single facility multi-class job scheduling, Comp. Oper. Res. 17(1990) 265-272.
2. H. Belouadah and C.N. Potts, Scheduling identical parallel machines to minimize total weighted completion time, Discrete Appl. Math. 48(1994)201-218.
3. H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time, Ann. Oper. Res. 70 (1997)261-279.
4. M.L. Fisher, A dual algorithm for the one-machine scheduling problem, Math. Prog. 11(1976)229-251.
5. J.B. Ghosh, Batch scheduling to minimize total completion time, Oper. Res. Lett. 16(1994)271-275.
6. J.N.D. Gupta, Single facility scheduling with multiple job classes, Euro. J. Oper. Res. 8(1988) 42-45.
7. A.M.A. Hariri and C.N. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Discrete Appl. Math. 5(1983)99-109.
8. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Discrete Appl. Math. 2(1978)75-90.
9. A.J. Mason, Genetic algorithms and scheduling problems, Ph.D. Thesis, Department of Engineering, University of Cambridge, UK, 1992.
10. A.J. Mason and E.J. Anderson, Minimizing flow time on a single machine with job classes and setup times, Naval Res. Logist. 38(1991)333-350.
11. C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times, Oper. Res. 37(1989)798-804.
12. C.N. Potts and L.N. Van Wassenhove, An algorithm for single machine sequencing with deadlines to minimize total weighted completion time, Euro. J. Oper. Res. 12(1983)379-387.
13. C.N. Potts and L.N. Van Wassenhove, A branch and bound algorithm for the total weighted tardiness problem, Oper. Res. 33(1985)363-377.
14. 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.