Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates

被引：4

作者：

Mrad, Mehdi ^{[1
]}

Chalghoumi, Sabrine ^{[2
]}

Ladhari, Talel ^{[2
,3
,4
]}

Gharbi, Anis ^{[1
]}

机构：

[1] King Saud Univ, Dept Ind Engn, Riyadh, Saudi Arabia

[2] Univ Tunis, BADEM, Tunis 2059, Tunisia

[3] Univ Tunis, Ecole Super Sci Econ & Commerciales Tunis, 1089 Montfleury, Tunis, Tunisia

[4] Umm Al Qura Univ, Coll Business Management, Dept Business Adm, Mecca, Saudi Arabia

来源：

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2019年 / 26卷 / 06期

关键词：

flowshop; total completion time; release date; lower bounds; mixed-integer linear programming; INTEGER PROGRAMMING FORMULATIONS; SHOP SCHEDULING PROBLEM; LOCAL SEARCH; ALGORITHM;

D O I：

10.1111/itor.12421

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment-based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

引用

页码：2432 / 2449

页数：18

共 37 条

[1]

AHMADI RH, 1990, NAV RES LOG, V37, P967, DOI 10.1002/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO

[2]

2-K

[3] The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm [J].