Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times

Journal of the Operational Research Society

Volumn 52, Issue 4, 2001, Pages 449-462

  Allahverdi, A ^a   Aldowaisan, T ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Completion time; Heuristics; No wait; Setup time; Two machine flowshop

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JOB ANALYSIS; MACHINE SHOPS; PROCESS ENGINEERING; PRODUCTION ENGINEERING; SCHEDULING;

TWO MACHINE FLOWSHOP;

OPERATIONS RESEARCH;

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

References (31)

1. Hall NG and Sriskandarajah C (1996). A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44: 510-525.
2. Adiri I and Pohoryles D (1982). Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Res Logist 29: 495-504.
3. Rajendran C and Chaudhuri D (1990). Heuristic algorithms for continuous flowshop problem. Naval Res Logist 37: 695-705.
4. van der Veen JAA and van Dal R (1991). Solvable cases of the no-wait flowshop scheduling problem. J Opl Res Soc 42: 971-980.
5. Allahverdi A, Gupta JND and Aldowiasan TA (1999). A review of scheduling research involving setup considerations. OMEGA 27: 219-239.
6. Allahverdi A (2000). Minimizing mean flowtime in a two- machine flowshop with sequence independent setup times. Comp Oper Res 27: 111-127.
7. Srikar BN and Ghosh S (1986). A MILP model for the n-job, m-stage flowshop, with sequence-dependent setup times. Int J Prod Res 24: 1459-1472.
8. Stafford EF and Tseng FT (1990). On the Srikar-Ghosh MILP model for the N x M SDST flowshop problem. Int J Prod Res 28: 723-732.
9. Aldowaisan TA and Allahverdi A (1998). Total flowtime in no-wait flowshops with separated setup times. Comp Oper Res 25: 757-765.
10. Monma CL and Potts CN (1989). On the complexity of scheduling with batch setups. Opns Res 37: 798-804.
11. Chen B (1993). A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM J Comp 22: 1303-1318.
12. Pinedo M (1995). Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ.
13. Mason AJ and Anderson EJ (1991). Minimizing flowtime on a single-machine with job classes and setup times. Naval Res Logist 38: 333-350.
14. Chu C (1992). A branch-and-bound algorithm to minimize total tardiness with different release dates. Naval Res Logist 39: 265-283.
15. Daniels RL and Chambers RJ (1990). Multiobjective flow-shop scheduling. Naval Res Logist 37: 981-995.
16. Allahverdi A and Mittenthal J (1995). Scheduling on a two- machine flowshop subject to random breakdowns with a make-span objective function. Eur J Opl Res 81: 376-387.
17. Allahverdi A (1995). Two-stage production scheduling with separated setup times and stochastic breakdowns. J Opl Res Soc 46: 896-904.
18. Nawaz M, Enscore E and Ham I (1983). A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11: 91-95.
19. Rajendran C and Ziegler H (1997). Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Prod Plan Control 8: 568-576.
20. Sotskov YN, Tautenhahn T and Werner, F (1996). Heuristics for permutation flowshop scheduling with batch setup times. OR Spektrum 18: 67-80.
21. Sotskov YN, Tautenhahn T and Werner, F (1999). On the application of insertion techniques for job shop problems with batch setup times. RAIRO Oper Res 33: 209-245.
22. Woo HS and YimDS (1998). Aheuristic algorithm for mean flow objective in flowshop scheduling. Comp Oper Res 25: 175-182.
23. Hall NG and Posner ME (2001). Generating experimental data for scheduling problems. Opns Res to appear.
24. Campbell HG, Dudek RA and Smith ML (1970). A heuristic algorithm for the n-job, m-machine sequencing problem. Mngmt Sci 16: B630-B637.
25. Dannenbring DG (1977). An evaluation offlowshop sequencing heuristics. Mngmt Sci 23: 1174-1182.
26. Wang MY, Sethi SP and Van De Velde SL (1997). Minimizing makespan in a class of reentrant shops. Opns Res 45: 702-712.
27. Pan C-H and Chen J-S (1997). Scheduling alternative opera-tions in two-machine flow-shops. J Opl Res Soc 48: 533-540.
28. Sundararaghavan PS, Kunnathur AS and Viswanathan I (1997). Minimizing makespan in parallel flowshops. J Opl Res Soc 48: 834-842.
29. Allahverdi A and Aldowiasan T (1998). Job lateness in flow- shops with setup and removal times separated. J Opl Res Soc 49: 1001-1006.
30. Allahverdi A (1997). Scheduling in stochastic flowshops with independent setup, processing, and removal times. Comp Oper Res 24: 955-960.
31. Allahverdi A and Mittenthal J (1994). Scheduling on m parallel machines subject to random breakdowns to minimize expected mean flowtime. Naval Res Logist 41: 677-682.