ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times |
| |
Affiliation: | 1. School of Economics and Management, Xiamen University of Technology, Xiamen 361024, PR China;2. Department of Information Management, Yuan Ze University, Taoyuan 32003, Taiwan;3. Department of Automation, Tsinghua University, Beijing 100084, PR China |
| |
Abstract: | To date, the topic of unrelated parallel machine scheduling problems with machine-dependent and job sequence-dependent setup times has received relatively little research attention. In this study, a hybrid artificial bee colony (HABC) algorithm is presented to solve this problem with the objective of minimizing the makespan. The performance of the proposed HABC algorithm was evaluated by comparing its solutions to state-of-the-art metaheuristic algorithms and a high performing artificial bee colony (ABC)-based algorithm. Extensive computational results indicate that the proposed HABC algorithm significantly outperforms these best-so-far algorithms. Since the problem addressed in this study is a core topic for numerous industrial applications, this article may help to reduce the gap between theoretical progress and industrial practice. |
| |
Keywords: | Scheduling Unrelated parallel machines Setup times Artificial bee colony Metaheuristic |
本文献已被 ScienceDirect 等数据库收录! |
|