A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology

被引:24
|
作者
Fera, Marcello [1 ]
Macchiaroli, Roberto [1 ]
Fruggiero, Fabio [2 ]
Lambiase, Alfredo [3 ]
机构
[1] Univ Campania Luigi Vanvitelli, Dept Engn, Via Roma 29, Aversa, CE, Italy
[2] Univ Basilicata, Sch Engn, Via Nazario Sauro 85, Potenza, PZ, Italy
[3] Univ Salerno, Dept Ind Engn, Via Giovanni Paolo II, Fisciano, SA, Australia
关键词
Additive Manufacturing; Scheduling; Heuristics; Production Planning; OPTIMIZATION; MODELS; LASER;
D O I
10.5267/j.ijiec.2020.1.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the scholars but also by the practitioners who are looking to this new technology as a new integrated part of their traditional production systems. They need new scheduling models to adapt the traditional scheduling rules to the changed ones of the additive manufacturing. This paper deals with the enhancement of a scheduling problem for additive manufacturing just present in literature and the presentation of a new meta-heursitic (adapted to the new requirements of the additive manufacturing technology) based on the tabu-search algorithms. (C) 2020 by the authors; licensee Growing Science, Canada
引用
收藏
页码:401 / 414
页数:14
相关论文
共 50 条