Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability |
| |
| Affiliation: | 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. Department of Computer Science, Universidade Federal de Viçosa, MG 36570-900, Brazil;2. School of Management, Hefei University of Technology, Hefei, Anhui 230009, PR China;3. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;1. Department of Information Management, Chang Gung University, Taoyan, Taiwan;2. Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan |
| |
| Abstract: | This article considers the unrelated parallel machine scheduling problem with sequence- and machine-dependent setup times and machine-dependent processing times. Furthermore, the machine has a production availability constraint to each job. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines to minimize the total completion time. To solve the problem, a mathematical model for the optimal solution is derived, and hybrid genetic algorithms with three dispatching rules are proposed for large-sized problems. To assess the performance of the algorithms, computational experiments are conducted and evaluated using several randomly generated examples. |
| |
| Keywords: | Genetic algorithm Dispatching rule Unrelated parallel machine scheduling Sequence- and machine-dependent setup time Production availability |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
