A modified genetic algorithm for distributed scheduling problems |
| |
Authors: | H. Z. Jia A. Y. C. Nee J. Y. H. Fuh Y. F. Zhang |
| |
Affiliation: | (1) Department of Mechanical Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore, 119260 |
| |
Abstract: | Genetic algorithms (GAs) have been widely applied to the scheduling and sequencing problems due to its applicability to different domains and the capability in obtaining near-optimal results. Many investigated GAs are mainly concentrated on the traditional single factory or single job-shop scheduling problems. However, with the increasing popularity of distributed, or globalized production, the previously used GAs are required to be further explored in order to deal with the newly emerged distributed scheduling problems. In this paper, a modified GA is presented, which is capable of solving traditional scheduling problems as well as distributed scheduling problems. Various scheduling objectives can be achieved including minimizing makespan, cost and weighted multiple criteria. The proposed algorithm has been evaluated with satisfactory results through several classical scheduling benchmarks. Furthermore, the capability of the modified GA was also tested for handling the distributed scheduling problems. |
| |
Keywords: | Genetic algorithms distributed production distributed scheduling |
本文献已被 SpringerLink 等数据库收录! |
|