Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 257-264

  Hildebrandt, Torsten ^a   Heger, Jens ^a   Scholz Reiter, Bernd ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Dispatching rules; Genetic programming; Job shop scheduling; Stochastic system optimization

Indexed keywords

DISPATCHING RULES; JOB SHOP; JOB-SHOP SCHEDULING; MANUFACTURING SYSTEM; ON DYNAMICS; PRIORITY RULES; RULE SEARCH; SHOP FLOOR; SIMULATION OPTIMIZATION; STOCHASTIC SYSTEM OPTIMIZATION;

OPTIMIZATION; SCHEDULING; STOCHASTIC SYSTEMS;

GENETIC PROGRAMMING;

EID: 77955890955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830530     Document Type: Conference Paper

References (27)

1. L. Atlan, J. Bonnet, andM. Naillon. Learning distributed reactive strategies by genetic programming for the general job shop problem. May 1994.
2. J. H. Blackstone, D. T. Phillips, andG. L. Hogg. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20(1):27-45, 1982.
3. J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, andJ. Weglarz. Scheduling Computer and Manufacturing Processes. Springer, Berlin et al., 2nd edition, 2001.
4. J. Boesel, B. L. Nelson, andS.-H. Kim. Using ranking and selection to "clean up" after simulation optimization. Operations Research, 51(5):814-825, 2003.
5. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, andJ. Woodward. A classification of hyper-heuristics approaches. In M. Gendreau and J.-Y. Potvin, editors, Handbook of Meta-heuristics. Springer, 2nd edition. Forthcoming.
6. C. H. Chen, D. He, M. Fu, andL. H. Lee. Efficient simulation budget allocation for selecting an optimal subset. Informs Journal on Computing, 20(4):579-595, 2008.
7. C.-C. Chern andY.-L. Liu. Family-based scheduling rules of a sequence-dependent wafer fabrication system. IEEE Transactions on Semiconductor Manufacturing, 16(1):15-25, 2003.
8. T. C. Chiang, Y. S. Shen, andL. C. Fu. A new paradigm for rule-based scheduling in the wafer probe centre. International Journal of Production Research, 46(15):4111-4133, 2008.
9. R. W. Conway. Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16:228-237, 1965.
10. C. Dimopoulos andA. M. S. Zalzala. Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software, 32(6):489-498, 2001.
11. ECJ. A Java-based Evolutionary Computation Research System, project homepage, 2009. http://cs.gmu.edu/~eclab/projects/ecj/, last accessed 15th January 2010.
12. H. Fisher andG. L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth and G. L. Thompson, editors, Industrial Scheduling, pages 225-251. Prentice-Hall, 1963.
13. C. Geiger, R. Uzsoy, andH. Aytug. Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. Journal of Scheduling, 9(1):7-34, 2006.
14. C. D. Geiger andR. Uzsoy. Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research, 46(6): 1431-1454, 2008.
15. E. Hart, P. Ross, andD. Corne. Evolutionary scheduling: A review. Genetic Programming and Evolvable Machines, 6(2):191-220, 2005.
16. R. Haupt. A survey of priority rule-based scheduling. OR Spektrum, 11(1):3-16, 1989.
17. O. Holthaus andC. Rajendran. Efficient jobshop dispatching rules: further developments. Production Planning & Control, 11(2):171-178, 2000.
18. B. J. Huffman. An object-oriented version of SIMLIB (a simple simulation package). INFORMS Transactions on Education, 2(1) :1-15, 2001.
19. D. Jakobović andL. Budin. Dynamic scheduling with genetic programming. In P. Collet, M. Tomassini, M. Ebner, S. Gustafson, and A. Ekárt, editors, Proceedings of the 9th European Conference on Genetic Programming, volume 3905 of Lecture Notes in Computer Science, pages 73-84, Budapest, Hungary, 10 - 12 Apr. 2006. Springer.
20. D. Jakobović, L. Jelenković, andL. Budin. Genetic programming heuristics for multiple machine scheduling. In M. Ebner, M. O'Neill, A. Ekárt, L. Vanneschi, and A. I. Esparcia-Alcázar, editors, Proceedings of the 10th European Conference on Genetic Programming, volume 4445 of Lecture Notes in Computer Science, pages 321-330, Valencia, Spain, 11 - 13 Apr. 2007. Springer.
21. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
22. A. M. Law. Simulation modeling and analysis. McGraw-Hill, Boston, USA et al, 4. edition, 2007.
23. S. S. Panwalkar andW. Iskander. A survey of scheduling rules. Operations Research, 25(1):45-61, 1977.
24. M. Pinedo. Scheduling - Theory, Algorithms and Systems. Prentice Hall, Upper Saddle River, New Jersey, USA, 2nd edition, 2002.
25. C. Rajendran andO. Holthaus. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research, 116(1):156-170, July 1999.
26. C. Schmidt, J. Branke, andS. E. Chick. Integrating techniques from statistical ranking into evolutionary algorithms. Springer Berlin / Heidelberg, 3907:752-763, 2006.
27. J. C. Tay andN. B. Ho. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering, 54(3):453-473, 2008.