Logo image
Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm
期刊文章   同儕審查

Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm

James C. Chen, Cheng-Chun Wu, Chia-Wen ChenKou-Huang Chen
Expert Systems with Applications, 卷.39(11), 頁碼.10016-10021
09/2012

摘要

Flexible job shop Genetic Algorithm Grouping Genetic Algorithm Makespan Parallel machine Scheduling Tardiness Artificial Intelligence Computer Science Applications Engineering (all)
Based on Genetic Algorithm (GA) and Grouping Genetic Algorithm (GGA), this research develops a scheduling algorithm for job shop scheduling problem with parallel machines and reentrant process. This algorithm consists of two major modules: machine selection module (MSM) and operation scheduling module (OSM). MSM helps an operation to select one of the parallel machines to process it. OSM is then used to arrange the sequences of all operations assigned to each machine. A real weapon production factory is used as a case study to evaluate the performance of the proposed algorithm. Due to the high penalty of late delivery in military orders and high cost of equipment investment, total tardiness, total machine idle time and makespan are important performance measures used in this study. Based on the design of experiments, the parameters setting for GA and GGA are identified. Simulation results demonstrate that MSM and OSM respectively using GGA and GA outperform current methods used in practice. © 2012 Elsevier Ltd. All rights reserved.

相關連結

指標

1 檢視次數

詳細資料

Logo image