New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

International Journal of Production Research

Volumn 47, Issue 20, 2009, Pages 5717-5738

  Ruiz, Ruben ^a   Allahverdi, Ali ^b  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Flow lines; Flow shop; Flow shop scheduling; Genetic algorithms; Heuristics; Makespan; Math programming; Metaheuristics; Modelling; Scheduling

Indexed keywords

FLOW SHOP; FLOW SHOP SCHEDULING; HEURISTICS; MAKESPAN; MATH PROGRAMMING; METAHEURISTICS; MODELLING;

GENETIC ALGORITHMS; HEURISTIC METHODS; MACHINE DESIGN; MACHINE SHOP PRACTICE;

SCHEDULING ALGORITHMS;

EID: 70449578984     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802070942     Document Type: Article

References (35)

1. Aldowaisan, T. and Allahverdi, A., 2003. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30 (8), 1219-1231.
2. Allahverdi, A. and Aldowaisan, T., 2000. No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research, 7 (3), 245-264.
3. Allahverdi, A. and Aldowaisan, T., 2002. No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society, 53 (9), 1004-1015. (Pubitemid 34964226)
4. Allahverdi, A. and Aldowaisan, T., 2004. No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, 152 (1), 132-147.
5. Allahverdi, A., et al., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985-1032.
6. Allahverdi, A. and Soroush, H.M., 2008. The significance of reducing setup times/setup costs. European Journal of Operational Research, 187, 978-984.
7. Augusto, V., Xie, X., and Perdomo, V., 2008. Operating theatre scheduling using Lagrangian relaxation. European Journal of Industrial Engineering, 2 (2), 172-189.
8. Bagchi, T.P., Gupta, J.N.D., and Sriskandarajah, C., 2006. A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research, 169 (3), 816-854.
9. Ben Hmida, A., et al., 2007. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems. European Journal of Industrial Engineering, 1 (2), 223-240.
10. Bonney, M.C. and Gundry, S.W., 1976. Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly, 27 (4), 869-883.
11. Brown, S.I., McGarvey, R., and Ventura, J.A., 2004. Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. Journal of the Operational Research Society, 55 (6), 614-621.
12. Chandrasekaran, C., et al., 2007. Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach. European Journal of Industrial Engineering, 1 (2), 152-181.
13. Dileepan, P., 2004. A note on minimizing maximum lateness in a two-machine no-wait flowshop. Computers & Operations Research, 31 (12), 2111-2115.
14. Framinan, J.M., Leisten, R., and Rajendran, C., 2003. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research, 41 (1), 121-148.
15. Gangadharan, R. and Rajendran, C., 1993. Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics, 32 (3), 285-290.
16. Grabowski, J. and Pempera, J., 2005. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research, 32 (8), 2197-2212.
17. Hall, N.G. and Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3), 510-525.
18. Hendizadeh, S.H., ElMekkawy, T.Y., and Wang, G.G., 2007. Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times. European Journal of Industrial Engineering, 1 (4), 391-413.
19. King, J.R. and Spachis, A.S., 1980. Heuristics for flowshop scheduling. International Journal of Production Research, 18 (3), 345-357.
20. Li, X., et al., 2007. Influencing factors of job waiting time variance on a single machine. European Journal of Industrial Engineering, 1 (1), 56-73.
21. Nawaz, M., Enscore, Jr. E.E., and Ham, I., 1983. A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science, 11 (1), 91-95.
22. Pessan, C., Bouquard, J.L., and Neron, E., 2008. An unrelated parallel machines model for an industrial production resetting problem. European Journal of Industrial Engineering, 2 (2), 153-171.
23. Potts, C.N. and Van Wassenhove, L.N., 1982. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1 (5), 177-181.
24. Rajendran, C., 1994. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 45 (4), 472-478.
25. Reddi, S.S. and Ramamoorthy, C.V., 1972. On the flowshop sequencing problem with no-wait in process. Operational Research Quarterly, 23 (3), 323-331.
26. Röck, H., 1984a. Some new results in flow shop scheduling. Mathematical Methods of Operations Research, 28 (1), 11-16.
27. Röck, H., 1984b. The three-machine no-wait flow shop is NP-Complete. Journal of the ACM, 31 (2), 336-345.
28. Ruiz, R. and Allahverdi, A., 2007. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Flexible Manufacturing Technology, 35 (5/6), 551-565.
29. Ruiz, R., Maroto, C., and Alcaraz, J., 2006. Two new robust genetic algorithms for the flowshop scheduling problem. Omega-International Journal of Management Science, 34 (5), 461-476.
30. Ruiz, R. and Stützle, T., 2007. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177 (3), 2033-2049.
31. Ruiz, R. and Stützle, T., 2008. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187 (3), 1143-1159.
32. Valente, J.M.S., 2007. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. European Journal of Industrial Engineering, 1 (4), 431-448.
33. Wang, X.L. and Cheng, T.C.E., 2006. A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups. Computers & Operations Research, 33 (5), 1326-1344.
34. Wismer, D.A., 1972. Solution of the flowshop scheduling problem with no intermediate queues. Operations Research, 20 (3), 689-697.
35. Yu, X., Ram, B., and Jiang, X., 2007. Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups. European Journal of Industrial Engineering, 1 (2), 182-199.