Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

Computers and Operations Research

Volumn 36, Issue 4, 2009, Pages 1268-1283

  Ruiz, Rubén ^a   Allahverdi, Ali ^b  

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

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Bicriteria; Flowshop; Genetic algorithms; Heuristics; Metaheuristics; Multiobjective; Scheduling

Indexed keywords

ALGORITHMS; DIESEL ENGINES; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; POPULATION STATISTICS; SCHEDULING;

BICRITERIA; FLOWSHOP; HEURISTICS; METAHEURISTICS; MULTIOBJECTIVE;

GENETIC ALGORITHMS;

EID: 54449096182     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.12.013     Document Type: Article

References (33)

1. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
2. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science 11 1 (1983) 91-95
3. Framinan J.M., Leisten R., and Rajendran C. 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 (2003) 121-148
4. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 3 (2007) 2033-2049
5. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 2 (2005) 479-494
6. Framinan J.M., Gupta J.N.D., and Leisten R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55 12 (2004) 1243-1255
7. Hejazi S.R., and Saghafian S. Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 43 14 (2005) 2895-2929
8. Townsend W. Sequencing n jobs on m machines to minimize maximum tardiness: a branch-and-bound solution. Management Science 23 9 (1977) 1016-1019
9. Kim Y.D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society 44 1 (1993) 19-28
10. Hasija S., and Rajendran C. Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 11 (2004) 2289-2301
11. Vallada E., Ruiz R., and Minella G. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research 35 4 (2008) 1350-1373
12. T'kindt V., and Billaut J.C. Multicriteria scheduling: theory, models and algorithms. 2nd ed. (2006), Springer, Berlin
13. Garey M.R., Johnson D.S., and Sethi R. The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
14. Du J.Z., and Leung J.Y.T. Minimizing total tardiness on one machine is NP-Hard. Mathematics of Operations Research 15 3 (1990) 483-495
15. Minella G, Ruiz R, Ciavotta M. A review and evaluation of multi-objective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing, to appear.
16. Daniels R.L., and Chambers R.J. Multiobjective flowshop scheduling. Naval Research Logistics 37 6 (1990) 981-995
17. Chakravarthy K., and Rajendran C. A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Production Planning & Control 10 7 (1999) 707-714
18. Allahverdi A. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Computers & Operations Research 187 2 (2004) 157-180
19. Framinan J.M., and Leisten R. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness. International Journal of Production Economics 99 1-2 (2006) 28-40
20. Ruiz R., and Allahverdi A. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology 35 (2007) 551-565
21. Ruiz R., and Allahverdi A. Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Annals of Operations Research 156 (2007) 143-171
22. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega-International Journal of Management Science 34 5 (2006) 461-476
23. Ruiz R., Maroto C., and Alcaraz J. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research 165 1 (2005) 34-54
24. Ruiz R., and Maroto C. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169 3 (2006) 781-800
25. Potts C.N., and Van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1 (1982) 177-181
26. Taillard E. Benchmarks for Basic Scheduling Problems. European Journal of Operational Research 64 2 (1993) 278-285
27. Montgomery D.C. Design and analysis of experiments. 6th ed. (2005), Wiley, Hoboken, NJ
28. Li X., Ye N., Xu X., and Sawhey R. Influencing factors of job waiting time variance on a single machine. European Journal of Industrial Engineering 1 1 (2007) 56-73
29. Valente J.M.S. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. European Journal of Industrial Engineering 1 4 (2007) 431-448
30. Yu X., Ram B., and Jiang X. Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups. European Journal of Industrial Engineering 1 2 (2007) 182-199
31. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 3 (2008) 985-1032
32. Hendizadeh S.H., ElMekkawy T.Y., and Wang G.G. Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times. European Journal of Industrial Engineering 1 4 (2007) 391-413
33. Ben Hmida A., Huguet M.J., Lopez P., and Haouari M. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems. European Journal of Industrial Engineering 1 2 (2007) 223-240