The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

International Journal of Operational Research

Volumn 2, Issue 2, 2007, Pages 135-155

  Ng, C T ^a   Allahverdi, Ali ^b   Al Anzi, Fawaz S ^b   Cheng, T C Edwin ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Dominance relation; Flowshop; Heuristics; Maximum lateness; Scheduling

Indexed keywords

EID: 34047222441     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2007.012457     Document Type: Article

References (27)

1. Al-Anzi, F.S. and Allahverdi, A. (2001) 'The relationship between three-tiered client-server internet database connectivity and two-machine flowshop', International Journal of Parallel and Distributed Systems and Networks, Vol. 4, pp.94-101.
2. Allahverdi, A. (1995) 'Two-stage production scheduling with separated setup times and stochastic breakdowns', Journal of the Operational Research Society, Vol. 46, pp.896-904.
3. Allahverdi, A. (2000) 'Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times', Computers and Operations Research, Vol. 27, pp.111-127.
4. Allahverdi, A. and Al-Anzi, F.S. (2002) 'Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications', Computers and Operations Research, Vol. 29, pp.971-994.
5. Allahverdi, A. and Al-Anzi, F.S. (2006) 'A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times', European Journal of Operational Research, Vol. 169, pp.767-780.
6. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T.A. (1999) 'A review of scheduling research involving setup considerations', OMEGA The International Journal of Management Sciences, Vol. 27, pp.219-239.
7. Allahverdi, A., Ng, C.T., Cheng, T.C.E. and Kovalyov, M.Y. (2006) 'A survey of scheduling problems with setup times or costs', European Journal of Operational Research (to appear).
8. Bagga, P.C. and Khurana, K. (1986) 'Two-machine flowshop with separated sequence-independent setup times: mean completion time criterion', Indian Journal of Management and Systems, Vol. 2, pp.47-57.
9. Bianco, L., Ricciardelli, S., Rinaldi, G. and Sassano, A. (1988) 'Scheduling tasks with sequence-dependent processing times', Naval Research Logistics, Vol. 35, pp.177-184.
10. Bitran, G.R. and Gilbert, S.M. (1990) 'Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost', Journal of Manufacturing and Operations Management, Vol. 3, pp.24-52.
11. Cheng, T.C.E., Janiak, A. and Kovalyov, M.Y. (2001) 'Single machine batch scheduling with resource dependent setup and processing times', European Journal of Operational Research, Vol. 135, pp.177-183.
12. Chu, C. (1992) 'A branch-and-bound algorithm to minimize total tardiness with different release dates', Naval Research Logistics, Vol. 39, pp.265-283.
13. Dileepan, P. and Sen, T. (1991) 'Job lateness in a two-machine flowshop with setup times separated', Computers and Operations Research, Vol. 18, pp.549-556.
14. Elmasri, R. and Navathe, S.B. (1999) Fundamentals of Database Systems, 3rd ed., Addison-Wesley, New York.
15. Kim, S.C. and Bobrowski, P.M. (1994) 'Impact of sequence-dependent setup-times on job shop scheduling performance', International Journal of Production Research, Vol. 32, pp.1503-1520.
16. Kim, Y.D. (1993) 'A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops', Computers and Operations Research, Vol. 20, pp.391-401.
17. Kim, Y.D. (1995) 'Minimizing total tardiness in permutation flowshops', European Journal of Operational Research, Vol. 85, pp.541-555.
18. Lin, B.M.T. and Jeng, A.A.K. (2004) 'Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs', International Journal of Production Economics, Vol. 91, pp.121-134.
19. Pan, J.C.H., Chen, J.S. and Cheng, H.L. (2001) 'A heuristic approach for single-machine scheduling with due dates and class setups', Computers and Operations Research, Vol. 28, pp.1111-1130.
20. Rios-Mercado, R. and Bard, J.F. (1998) 'Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups', Computers and Operations Research, Vol. 25, pp.351-366.
21. Rios-Mercado, R. and Bard, U. (1999) 'Enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times', Journal of Heuristics, Vol. 5, pp.53-70.
22. Ruiz, R. and Maroto, C. (2005) 'A comprehensive review and evaluation of permutation flowshop heuristics', European Journal of Operational Research, Vol. 165, pp.479-494.
23. Ruiz, R. and Maroto, C. (2006) 'A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility', European Journal of Operational Research, Vol. 169, pp.781-800.
24. Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N. and Azaron, A. (2005) 'Solving a dynamic cell formation problem using metaheuristics', Applied Mathematics and Computation, Vol. 170, pp.761-780.
25. Uzsoy, R., Lee, C. and Martin-Vega, A. (1992) 'Scheduling semiconductor test operations: minimizing maximum lateness and number of tardy jobs on a single machine', Naval Research Logistics, Vol. 39, pp.369-388.
26. Volgenant, A. and Teerhuis, E. (1999) 'Improved heuristics for the n-job single machine weighted tardiness problem', Computers and Operations Research, Vol. 26, pp.35-44.
27. Yoshida, T. and Hitomi K. (1979) 'Optimal two-stage production scheduling with setup times separated', AIIE Transactions, Vol. 11, pp.261-263.