Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm

European Journal of Operational Research

Volumn 194, Issue 3, 2009, Pages 637-649

  Zhou, Hong ^a   Cheung, Waiman ^b   Leung, Lawrence C ^b  

^a BEIHANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Genetic algorithm; Heuristics; Scheduling production

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC METHODS; NUCLEAR PROPULSION; REINFORCEMENT LEARNING; SCHEDULING;

FLOW TIMES; HEURISTICS; HYBRID FRAMEWORKS; HYBRID GENETIC ALGORITHMS; JOB SHOPS; JOB-SHOP SCHEDULING PROBLEMS; MAKESPAN; NEW GENERATIONS; NP-HARD; NUMERICAL EXPERIMENTS; PARALLEL EVOLUTIONS; RANDOM WALKS; SCHEDULING PROBLEMS; SCHEDULING/PRODUCTION; SET-UPS; SHOP SCHEDULING; TOTAL TARDINESSES; TOTAL WEIGHTED TARDINESSES; WEIGHTED TARDINESSES; WITH OR WITHOUT;

HEURISTIC ALGORITHMS;

EID: 55149114608     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.063     Document Type: Article

References (40)

1. Anderson E.J., Glass C.A., and Potts C.N. Machine scheduling. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local Search Algorithms in Combinatorial Optimization (1997), Wiley 3061-3414
2. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, NY
3. Brucker P. Scheduling Algorithms. second ed. (1998), Springer, Berlin
4. Chambers R.J., Carraway R.L., Lowe T.J., and Morin T.L. Dominance and de-composition heuristics for single machine scheduling. Operations Research 39 4 (1991) 639-648
5. Chen C., and Bulfin R.L. Scheduling a single machine to minimize two criteria: Maximum tardiness and number of tardy jobs. IIE Transactions 26 5 (1994) 76-84
6. Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms. Part II: Hybrid genetic search strategies. Computer and Industrial Engineering 36 (1999) 343-364
7. Cheung W., and Zhou H. Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Annals of Operations Research 107 (2001) 65-81
8. Croce F., Tadei R., and Volta G. A genetic algorithm for the job shop problem. Computers and Operations Research 22 (1995) 12-24
9. Davis, L., 1985. Applying adaptive algorithms to domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 162-164.
10. Davis L. Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold, NY
11. Tasgetiren M., Liang Y., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 3 (2007) 1930-1947
12. Gen M., and Cheng R.W. Genetic Algorithms and Engineering Design (1996), John Wiley & Sons Inc., NY
13. Goldberg D., and Lingle R. Alleles, loci and the traveling salesman problem. In: Grefenstette J. (Ed). Proceedings of the First International Conference on Genetic Algorithms and Their Application (1985), Hillsdale, NJ 154-159
14. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley, NY
15. Jans R., and Degraeve Z. Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research 177 3 (2007) 1855-1875
16. Koulamas C. The total tardiness problem: Review and extensions. Operations Research 42 6 (1994) 1025-1041
17. Kreipl S. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling 3 (2000) 125-138
18. Lawrence S. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (1984), GSIA, Carnegie Mellon University, Pittsburgh
19. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997) 45-52
20. Liaw C.F., Lin Y.K., Cheng C.Y., and Chen M. Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers and Operations Research 30 (2003) 1777-1789
21. Mattfeld D.C., and Bierwirth C. An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155 3 (2004) 616-630
22. Mönch L., Schabacker R., Pabst D., and Fowler J.W. Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. European Journal of Operational Research 177 3 (2007) 2100-2118
23. Morton T.E., and Pentico D.W. Heuristic Scheduling Systems (1993), John Wiley & Sons, NY
24. Norman B.A., and Bean J.C. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 (1998) 100-211
25. Oliver I., Smith D., and Holland J. A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette J. (Ed). Proceedings of Second International Conference on Genetic Algorithms and Their Application (1987), Hillsdale, NJ 224-230
26. Pinedo M. Scheduling: Theory, Algorithms and Systems (1995), Prentice-Hall, NJ
27. Pinedo M., and Singer M. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46 1 (1999) 1-17
28. Raghu T.S., and Rajendran C. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics 32 (1993) 301-313
29. Rajendran C., and Holthaus O. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116 1 (1999) 156-170
30. 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
31. Sen T., Sulek J.M., and Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey. International Journal Production Economics 83 (2002) 1-12
32. Singer M., and Pinedo M. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 30 2 (1998) 109-118
33. Storer S.S., Wu D., and Vaccari R. New search spaces for sequencing problems with application to job shop. Management Science 38 10 (1992) 1495-1509
34. Sun X., Noble J.S., and Klein C.M. Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Transactions 31 (1999) 113-124
35. Sun X., and Noble J.S. An approach to job shop scheduling with sequence-dependent setups. Journal of Manufacturing Systems 18 6 (1999) 416-430
36. Szwarc W., and Liu J.J. Weighted tardiness single machine scheduling with proportion. Management Science 39 5 (1993) 626-633
37. Tan, K.C., Burke, E., Lee, T.H. (Guest editors), 2007. Evolutionary and meta-heuristic scheduling. European Journal of Operational Research 177 (3), 1852-1854.
38. Yang T., He Z., and Cho K.K. An effective heuristic method for generalized job shop scheduling with due dates. Computers and Industrial Engineering 26 4 (1994) 647-660
39. Yun Y., Gen M., and Seo S. Various hybrid methods based on genetic algorithm with fuzzy logic controller. Journal of Intelligent Manufacturing 14 (2002) 401-419
40. Zhou H., Feng Y.Z., and Han L.M. The hybrid heuristic genetic algorithm for job shop scheduling. Computers and Industrial Engineering 40 3 (2001) 191-200