Learning iterative dispatching rules for job shop scheduling with genetic programming

International Journal of Advanced Manufacturing Technology

Volumn 67, Issue 1-4, 2013, Pages 85-100

  Nguyen, Su ^a   Zhang, Mengjie ^a   Johnston, Mark ^a   Tan, Kay Chen ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Dispatching rule; Genetic programming; Job shop; Local search

Indexed keywords

COMPOSITE DISPATCHING RULES; COMPUTATIONAL EFFORT; DISPATCHING RULES; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; LARGE-SCALE MANUFACTURING; LOCAL SEARCH; TOTAL-WEIGHTED TARDINESS;

GENETIC PROGRAMMING; SCHEDULING ALGORITHMS;

ITERATIVE METHODS;

EID: 84888316121     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-013-4756-9     Document Type: Article

References (51)

1. Anderson E, Glass C, Potts C (1997) Machine scheduling. In: Aarts L (ed) Local search in combinatorial optimization. Wiley, Chichester, pp 361-414
2. Applegate D, Cook W (1991) A computational study of the job-shop scheduling instance. ORSA J Comput 3:149-156
3. Asano M, Ohta H (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Comput Ind Eng 42:137-147
4. Baker KR (1984) Sequencing rules and due-date assignments in a job shop. Manag Sci 30:1093-1104
5. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manag Sci 44:262-275
6. Banzhaf W, Nordin P, Keller R, Francone F (1998) Genetic programming: an introduction. Morgan Kaufmann, San Francisco
7. Bierwirth C, Mattfeld DC (1999) Production scheduling and rescheduling with genetic algorithms. Evol Comput 7(1):1-17
8. Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: representation. Comput Ind Eng 30(4):983-997
9. Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Comput Ind Eng 36(2):343-364
10. Chiang TC, Shen YS, Fu LC (2008) A new paradigm for rule-based scheduling in the wafer probe centre. Int J Prod Res 46(15):4111-4133
11. Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper Res 109(1):137-141
12. Dorndorf U, Pesch E (1995) Evolution based learning in a job shop scheduling environment. Comput Oper Res 22(1):25-40
13. French S (1986) Sequencing and scheduling: an introduction to the mathematics of the job-shop. Ellis Horwood, Chichester
14. Giffler B, Thompson GL (1960) Algorithms for solving production- scheduling problems. Oper Res 8:487-503
15. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533-549
16. Goncalves JF, de Magalhaes Mendes JJ, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77-95
17. Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449-467
18. Hart E, Ross P (1998) A heuristic combination method for solving job-shop scheduling problems. In: Proceedings of the 5th international conference on parallel problem solving from nature, PPSN V, pp 845-854
19. Hildebrandt T, Heger J, Scholz-Reiter B (2010) Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: GECCO'10: proceedings of the 12th annual conference on genetic and evolutionary computation, pp 257-264
20. Ingimundardottir H, Runarsson T (2011) Supervised learning linear priority dispatch rules for job-shop scheduling. In: Learning and intelligent optimizatioN (LION 5), pp 263-277
21. Jakobovic D, Budin L (2006) Dynamic scheduling with genetic programming. In: EuroGP'06: proceedings of the 9th European conference on genetic programming, pp 73-84
22. Jayamohan MS, Rajendran C (2000) New dispatching rules for shop scheduling: a step forward. Int J Prod Res 38:563-586
23. Jayamohan MS, Rajendran C (2004) Development and analysis of cost-based dispatching rules for job shop scheduling. Eur J Oper Res 157(2):307-321
24. Jones A, Rabelo LC (1998) Survey of job shop scheduling techniques. Tech. rep., NISTIR, National Institute of Standards and Technology, Gaithersburg, USA
25. Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge
26. Kreipl S (2000) A large step random walk for minimizing total weighted tardiness in a job shop. J Sched 3:125-138
27. van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113-125
28. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Ph.D. thesis, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania
29. Li X, Olafsson S (2005) Discovering dispatching rules using data mining. J Sched 8:515-527
30. Lourenco HR (1995) Job-shop scheduling: computational study of local search and large-step optimization methods. Eur J Oper Res 83(2):347-364
31. Luke S (2009) Essentials of metaheuristics. Lulu, Raleigh
32. McKay KN, Safayeni FR, Buzacott JA (1988) Job-shop scheduling theory: what is relevant? Interfaces 18:84-90
33. Miyashita K (2000) Job-shop scheduling with GP. In: GECCO'00: proceedings of the genetic and evolutionary computation conference, pp 505-512
34. Mizrak P, Bayhan GM (2006) Comparative study of dispatching rules in a real-life job shop environment. Appl Artif Intell 20:585-607
35. Nguyen S, Zhang M, Johnston M, Tan KC (2012a) A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems. In: CEC'12: IEEE congress on evolutionary computation, pp 3332-3339
36. Nguyen S, Zhang M, Johnston M, Tan KC (2012b) Evolving reusable operation-based due-date assignment models for job shop scheduling with genetic programming. In: EuroGP'12: proceedings of the 15th European conference on genetic programming, LNCS, vol 7244, pp 121-133
37. Nie L, Shao X, Gao L, Li W (2010) Evolving scheduling rules with gene expression programming for dynamic single-machine scheduling problems. Int J Adv Manuf Technol 50:729-747
38. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797-813
39. Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25:45-61
40. Pardalos P, Shylo O (2006) An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Comput Manag Sci 3:331-348
41. Petrovic S, Fayad C, Petrovic D, Burke E, Kendall G (2008) Fuzzy job shop scheduling with lot-sizing. Ann Oper Res 159:275-292
42. Pinedo M, Singer M (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav Res Logist 46(1):1-17
43. Pinedo ML (2008) Scheduling: theory, algorithms, and systems, 3rd edn. Springer, New York
44. Ponnambalam SG, Ramkumar V, Jawahar N (2001) A multiobjective genetic algorithm for job shop scheduling. Prod Plan Control 12(8):764-774
45. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495-1509
46. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278-285
47. Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54:453-473
48. Vázquez-Rodríguez JA, Petrovic S (2010) A new dispatching rule based genetic algorithm for the multi-objective job shop problem. J Heuristics 16(6):771-793
49. Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manage Sci 33:1035-1047
50. Yamada T, Nakano R (1995) A genetic algorithm with multi-step crossover for job-shop scheduling problems. In: GALESIA: first international conference on genetic algorithms in engineering systems: innovations and applications, pp 146-151
51. Zhou H, Cheung W, Leung LC (2009) Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur J Oper Res 194(3):637-649