Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Operations Research Letters

Volumn 33, Issue 4, 2005, Pages 421-430

  Iravani, S M R ^a   Teo, C P ^b  

^a Northwestern University   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Asymptotic optimality; Flexible machine scheduling; Flow shop; Setup times

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; FLEXIBLE MANIPULATORS; INVENTORY CONTROL; MATHEMATICAL MODELS; PERSONNEL TRAINING; PROBLEM SOLVING; SCHEDULING; SERVERS; THEOREM PROVING;

ASYMPTOTIC OPTIMALITY; FLEXIBLE MACHINE SCHEDULING; FLOW SHOP; SETUP TIME;

JOB ANALYSIS;

EID: 14844314792     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.08.007     Document Type: Article

References (13)

1. D. Bertsimas, D. Gamarnik, and J. Sethuraman From fluid relaxations to practical algorithms for job high multiplicity job shop scheduling the holding cost objective Oper. Res. 51 2003 798 813
2. P. Brucker, B. Jurisch, and A. Kraemer Complexity of scheduling problems with multi-purpose machines Ann. Oper. Res. 70 1997 57 73
3. P. Brucker, and R. Schlie Job-shop scheduling with multi-purpose machines Computing 45 1990 369 375
4. C. Chekuri, and R. Motwani Precedence constrained scheduling to minimize weighted completion time on a single machine Discrete Appl. Math. 98 1999 29 38
5. M.X. Goemans, and D.P. Williamson Two-dimensional Gantt charts and a scheduling algorithm of Lawler SIAM J. Discrete Math. 13 2000 281 294
6. S.M.R. Iravani, J.A. Buzacott, and M.J.M. Posner Operations and shipment scheduling of a batch on a flexible machine Oper. Res. 51 2003 585 601
7. S.M.R. Iravani, C.P. Teo, Asymptotic optimal schedules for the flexible machine scheduling problem with setup costs and times. Working Paper # 04-004, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 2003.
8. P. Kaminsky, and D. Simch-levi The asymptotic optimality of the shortest processing time rule for the flow shop completion time problem Oper. Res. 49 2001 293 304
9. F. Margot, M. Queyranne, and Y. Wang Decomposition, network flows and a precedence constrained single machine scheduling problem Oper. Res. 51 2003 981 992
10. M. Pinedo Scheduling Theory, Algorithms and Systems 1995 Prentice-Hall Englewood Cliffs, NJ
11. M.E. Posner The dead line constrained weighted completion time problem analysis of a heuristic Oper. Res. 36 1988 742746
12. C.N. Potts Analysis of a heuristic for one machine sequencing with release dates and delivery times Oper. Res. 28 1980 1436 1441
13. J.B. Sidney Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs Oper. Res. 23 1975 283 298