Minimizing sum of completion times on a single machine with sequence-dependent family setup times

Journal of the Operational Research Society

Volumn 57, Issue 3, 2006, Pages 271-280

  Karabati, S ^a   Akkan, C ^b  

^a KOÇ UNIVERSITY   (Turkey)

^b SABANCI UNIVERSITY   (Turkey)

Author keywords

Branch and bound; Family setups; Lagrangean relaxation; Single machine scheduling; Sum of completion times

Indexed keywords

LAGRANGE MULTIPLIERS; PROBLEM SOLVING; RELAXATION PROCESSES; SCHEDULING;

BRANCH-AND-BOUND; FAMILY SETUPS; LAGRANGEAN RELAXATION; SINGLE MACHINE SCHEDULING; SUM OF COMPLETION TIMES;

ALGORITHMS;

EID: 33644615103     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601989     Document Type: Article

References (17)

1. Webster S and Baker KR (1995). Scheduling groups of jobs on a single machine. Opns Res 43: 692-703.
2. Ahn BH and Hyun JH (1990). Single facility multi-class job scheduling. Comput Opns Res 17: 265-272.
3. Mason AJ and Anderson EJ (1991). Minimizing flow time on a single machine with job classes and setup times. Naval Res Logist 38: 333-350.
4. Potts CN and Van Wassenhove LN (1992). Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Opl Res Soc 43: 395-406.
5. Ernst AT, Krishnamoorthy M and Storer RH (1999). Heuristic and exact algorithms for scheduling aircraft landings. Networks 34: 229-241.
6. Moss S, Dale C and Brame G (2000). Sequence-dependent scheduling at Baxter International. Interfaces 30(2): 70-80.
7. Schaller EJ, Gupta JND and Vakharia AJ (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur J Opl Res 125: 324-339.
8. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Handbooks in Operations Research and Management Science Vol 4. Elsevier, Amsterdam, 1993.
9. Rinnooy Kan AHG (1976). Machine Scheduling Problems: Classification; Complexity and Computations. Nijhoff: The Hague.
10. Gupta JND (1988). Single facility scheduling with multiple job classes. Eur J Opl Res 8: 42-45.
11. Monma CL and Potts CN (1989). On the complexity of scheduling with batch setup times. Opns Res 37: 798-804.
12. Ghosh JB (1994). Batch scheduling to minimize total completion time. Opns Res Lett 16: 271-275.
13. Crauwels HAJ, Hariri AM A, Potts CN and Van Wassenhove LN (1998). Branch and bound algorithms for single machine scheduling with batch setup times to minimize total weighted completion time. Ann Opns Res 83: 59-76.
14. Dunstall S, Wirth A and Baker K (2000). Lower bounds and algorithms for flowtime minimization on a single machine with set-up times. J Scheduling 3: 51-69.
15. Mason AJ (1992). Genetic Algorithms and Scheduling Problems. PhD thesis, University of Cambridge.
16. Crauwels HAJ, Potts CN and Van Wassenhove LN (1997). Local search heuristics for single machine scheduling with batch setup times to minimize total weighted completion time. Ann Opns Res 70: 261-279.
17. Fisher ML (1985). An applications oriented guide to lagrangean relaxation. Interfaces 15(2): 10-21.