Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 11, Issue 2, 2004, Pages 113-123

  Aldowaisan, Tariq ^a   Allahverdi, Ali ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Dominance relation; Heuristics; No wait flowshop; Setup and removal times; Total completion time

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ERROR ANALYSIS; HEURISTIC METHODS; JOB ANALYSIS; PROBLEM SOLVING; THEOREM PROVING; TIME AND MOTION STUDY;

NO-WAIT FLOWSHOP; TOTAL COMPLETION TIME;

INDUSTRIAL ENGINEERING;

EID: 3943056166     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Aldowaisan, T., and Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research, 25: 757-765.
2. Allahverdi, A., Aldowaisan, T. (2000). No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research, 7: 245-264.
3. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences, 27: 219-239.
4. Gupta, J.N.D., Strusevich, V.A., and Zwaneveld, C.M. (1997). Two-stage no-wait scheduling models with setup and removal times separated. Computers and Operations Research, 24: 1025-1031.
5. Hall N.G. and Sriskandarajah C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44: 510-525.
6. Monma, C.L. and Potts, C.N. (1989). On the complexity of scheduling with batch setups. Operations Research,37: 798-804.
7. Nawaz, M., Enscore, E., and Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Science, 11: 91-95.
8. Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, N.J.
9. Rajendran, C. and Chaudhuri, D. (1990). Heuristic algorithms for continuous flowshop problem. Naval Research Logistics, 37: 695-705.
10. Sule, D.R. and Huang, K.Y. (1983). Sequencing on two and three machines with setup, processing and removal times separated. International Journal of Production Research, 21: 723-732.
11. Uzsoy, R., Martin-Vega, L.A., Lee, C.Y., and Leonard, P.A. (1991). Production scheduling algorithms for a semiconductor test facility. IEEE Transactions on Semiconductor Manufacturing, 4: 270-280.
12. Van der Veen, J.A.A. and van Dal R. (1991). Solvable cases of the no-wait flowshop scheduling problem. Journal of the Operational Research Society, 42: 971-980.
13. Woo, H. S., and Yim, D.S. (1998). A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations