Exact solution of the two-machine flow shop problem with three operations

被引：2
|
作者：
Della Croce F. [1 ,2 ]
Salassa F. [1 ]
T'kindt V. [3 ]
机构：
[1] Dipartimento di Ingegneria Gestionale e della Produzione, Politecnico di Torino, Corso Duca degli Abruzzi 24, Torino
[2] CNR, IEIIT, Torino
[3] Laboratoire d'Informatique Fondamentale et Appliquée (LIFAT, EA 6300), ERL CNRS 7002 ROOT, University of Tours, 64 avenue Jean Portalis, Tours
来源：
Computers and Operations Research | 2022年 / 138卷
关键词：
Exact approach; IP modeling; Two-machine flow shop with three operations;
D O I：
10.1016/j.cor.2021.105595
中图分类号：
学科分类号：
摘要：
We consider the NP-hard two-machine flow shop problem with three operations with the objective of minimizing the makespan. We exploit the links between this problem and another two-machine flow shop problem with common due date and jobs selection. We show how to tailor to this problem the constraint generation approach already successfully applied in the literature to the latter problem. Computational testing indicates that the proposed approach solves to optimality, within 120 s all instances with up to 40000 jobs. © 2021 Elsevier Ltd
引用
收藏
相关论文
共 50 条
12345