期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 285, 期 3, 页码 955-964出版社
ELSEVIER
DOI: 10.1016/j.ejor.2020.02.047
关键词
Combinatorial optimization; Flexible manufacturing systems; Metaheuristics; Parallel machines; Scheduling
资金
- National Counsel of Technological and Scientific Development (Conselho Nacional de Desenvolvimento Cientifico e Tecnologico, CNPq)
- Universidade Federal de Ouro Preto
We address the problem of scheduling a set of n jobs on m parallel machines, with the objective of minimizing the makespan in a flexible manufacturing system. In this context, each job takes the same processing time in any machine. However, jobs have different tooling requirements, implying that setup times depend on all jobs previously scheduled on the same machine, owing to tool configurations. In this study, this NP-hard problem is addressed using a parallel biased random-key genetic algorithm hybridized with local search procedures organized using variable neighborhood descent. The proposed genetic algorithm is compared with the state-of-the-art methods considering 2,880 benchmark instances from the literature reddivided into two sets. For the set of small instances, the proposed method is compared with a mathematical model and better or equal results for 99.86% of instances are presented. For the set of large instances, the proposed method is compared to a metaheuristic and new best solutions are presented for 93.89% of the instances. In addition, the proposed method is 96.50% faster than the compared metaheuristic, thus comprehensively outperforming the current state-of-the-art methods. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据