A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines |
| |
| Affiliation: | 1. School of Management, University of Science and Technology of China, Hefei, Anhui 230026, China;2. School of Finance, Nankai University, Tianjin 300071, China;3. School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230026, China;4. Department of Industrial and Systems Engineering, University of Tennessee, Knoxville, TN 37996, USA;1. Department of Management Science, University of Miami, Miami, FL 33124, USA;2. Department of Industrial and Systems Engineering, Northern Illinois University, DeKalb, IL 60115, USA;3. Norfolk Southern Corporation, Norfolk, VA 23510, USA;1. Singapore Management University, Singapore;2. Department of Information Technology and Decision Sciences, G. Brint Ryan College of Business, University of North Texas, Denton, TX, USA;3. Department of Industrial Engineering, Tecnologico de Monterrey, Monterrey, NL, Mexico;4. Business Analytics Research Center, Chang Gung University, Taoyuan, Taiwan;1. Mines Saint-Etienne, Univ Clermont Auvergne, CNRS, UMR 6158 LIMOS, CMP, Department of Manufacturing Sciences and Logistics, Gardanne, France;2. Department of Accounting, Auditing and Business Analytics, BI Norwegian Business School, Oslo, Norway;1. Performance Analysis Center of Production and Operations Systems (PacPos), Northwestern Polytechnical University, Xi?an, Shaanxi 710072, PR China;2. Key Laboratory of Contemporary Design and Integrated Manufacturing Technology, Ministry of Education, Northwestern Polytechnical University, Xi?an, Shaanxi 710072, PR China;3. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, United States |
| |
| Abstract: | Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem, but there have been many difficulties in the course of solving large scale identical parallel machine scheduling problem with too many jobs and machines. Genetic algorithms have shown great advantages in solving the combinatorial optimization problem in view of its characteristic that has high efficiency and that is fit for practical application. In this article, a kind of genetic algorithm based on machine code for minimizing the makespan in identical machine scheduling problem is presented. Several different scale numerical examples demonstrate the genetic algorithm proposed is efficient and fit for larger scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantage over heuristic procedure and simulated annealing method. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
