A new lower bound for minimising the total completion time in a two-machine flow shop under release dates

被引：0

作者：

Chalghoumi, Sabrine ^{[1
]}

Mrad, Mehdi ^{[2
]}

Ladhari, Talel ^{[1
]}

机构：

[1] Ecole Super Sci Econ & Commerciales, Tunis, Tunisia

[2] King Saud Univ, Engn Coll, Riyadh 11451, Saudi Arabia

来源：

2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO) | 2013年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we describe a mixed integer linear programming (MILP) formulation used to model the two-machine flow shop scheduling problem subject to release dates. This MILP formulation is based on the Positional and Assignment Variables(PAVF). The results of the linear relaxation bound derived from the later mathematical formulation shows the performance of this new bound compared with the best known lower bound recently presented for the studied problem.

引用

页数：4

共 50 条

[11] A matheuristic approach for the two-machine total completion time flow shop problem
Della Croce, Federico
Grosso, Andrea
Salassa, Fabio
ANNALS OF OPERATIONS RESEARCH, 2014, 213 (01) : 67 - 78
[12] A simple lower bound for total completion time minimization in a two-machine flowshop
Lin, BMT
Wu, JM
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2005, 22 (03) : 391 - 407
[13] A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates
Rakrouki, Mohamed Ali
Ladhari, Talel
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 80 - +
[14] Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates
Mrad, Mehdi
Chalghoumi, Sabrine
Ladhari, Talel
Gharbi, Anis
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (06) : 2432 - 2449
[15] A New Lower Bound for Flow Shop Makespan with Release Dates
Bai, Danyu
Huo, Manchen
Tang, Lixin
IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 276 - 280
[16] Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
Yang, Shu-Hui
Wang, Ji-Bo
APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (09) : 4819 - 4826
[17] Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
Choi, BC
Yoon, SH
Chung, SJ
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (04) : 715 - 728
[18] Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time
He, Ning
Qiao, Yan
Wu, NaiQi
Qu, Ting
ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (03) : 1 - 12
[19] Minimizing the total flow time and the tardiness in a two-machine flow shop
Lee, WC
Wu, CC
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2001, 32 (03) : 365 - 373
[20] Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
Federico Della Croce
Andrea Grosso
Fabio Salassa
Journal of Heuristics, 2021, 27 : 159 - 173

← 1 2 3 4 5 →