Multiple-objective heuristics for scheduling unrelated parallel machines |
| |
Authors: | Yang-Kuei Lin John W. Fowler Michele E. Pfund |
| |
Affiliation: | 1. Department of Industrial Engineering and Systems Management, Feng Chia University, Taichung 40724, Taiwan, ROC;2. Department of Supply Chain Management, Arizona State University, P.O. Box 874706, Tempe, AZ 85287-4706, USA;3. School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, P.O. Box 878809, Tempe, AZ 85287-8809, USA |
| |
Abstract: | This research proposes two heuristics and a Genetic Algorithm (GA) to find non-dominated solutions to multiple-objective unrelated parallel machine scheduling problems. Three criteria are of interest, namely: makespan, total weighted completion time, and total weighted tardiness. Each heuristic seeks to simultaneously minimize a pair of these criteria; the GA seeks to simultaneously minimize all three. The computational results show that the proposed heuristics are computationally efficient and provide solutions of reasonable quality. The proposed GA outperforms other algorithms in terms of the number of non-dominated solutions and the quality of its solutions. |
| |
Keywords: | Scheduling Genetic algorithm Multiple-objective heuristics |
本文献已被 ScienceDirect 等数据库收录! |
|