Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems |
| |
| Authors: | Joc Cing Tay Nhu Binh Ho |
| |
| Affiliation: | 1. Faculty of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran;2. Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran;1. Department of Mechanical Engineering, National Institute of Technology, Kurukshetra 136119, Haryana, India;2. Department of Mechanical Engineering, Guru Jambheshwar University of Science and Technology, Hisar 125001, Haryana, India;1. Department of Industrial and Management Engineering, Dongseo University, San 69-1, Jurye-dong, Saanmg-gu, Busan 617-716, Republic of Korea;2. Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Songdo-dong, Yeonsu-gu, Incheon 406-772, Republic of Korea;1. Evolutionary Computation Research Group, Victoria University of Wellington, PO Box 600, Wellington, New Zealand;2. La Trobe University, Melbourne, Australia;1. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore;2. Computer School, Liaocheng University, Liaocheng 252000, PR China;3. Singapore Institute of Manufacturing Technology, Nanyang Drive 638075, Singapore |
| |
| Abstract: | We solve the multi-objective flexible job-shop problems by using dispatching rules discovered through genetic programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite dispatching rules have been shown to be more effective as they are constructed through human experience. In this paper, we evaluate and employ suitable parameter and operator spaces for evolving composite dispatching rules using genetic programming, with an aim towards greater scalability and flexibility. Experimental results show that composite dispatching rules generated by our genetic programming framework outperforms the single dispatching rules and composite dispatching rules selected from literature over five large validation sets with respect to minimum makespan, mean tardiness, and mean flow time objectives. Further results on sensitivity to changes (in coefficient values and terminals among the evolved rules) indicate that their designs are robust. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
