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 条

[41] A branch-and-bound algorithm for the two-machine flow-shop problem with time delays
Mkadem, Mohamed Amine
Moukrim, Aziz
Serairi, Mehdi
2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2017, : 690 - 695
[42] New results for minimising variation of flow time in two-machine proportionate no-wait flow shops
Panwalkar, S. S.
Koulamas, Christos
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (09) : 2789 - 2799
[43] Minimizing makespan in the two-machine flow-shop with release times
Politecnico di Torino, Torino, Italy
J Oper Res Soc, 1 (77-85):
[44] The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation
Detienne, Boris
Sadykov, Ruslan
Tanaka, Shunji
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (03) : 750 - 760
[45] MIP models for minimizing total tardiness in a two-machine flow shop
Kharbeche, M.
Haouari, M.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (05) : 690 - 707
[46] Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Blazewicz, Jacek
Chen, Xin
Lee, Richard C. T.
Lin, Bertrand M. T.
Lin, Feng-Cheng
Pesch, Erwin
Sterna, Malgorzata
Wang, Zhongyu
ENGINEERING OPTIMIZATION, 2019, 51 (07) : 1279 - 1280
[47] No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
Ben Chihaoui, Faten
Kacem, Imed
Hadj-Alouane, Atidel B.
Dridi, Najoua
Rezg, Nidhal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (21) : 6273 - 6286
[48] NEW HEURISTICS FOR MINIMISING TOTAL COMPLETION TIME AND THE NUMBER OF TARDY JOBS CRITERIA ON A SINGLE MACHINE WITH RELEASE TIME
Oyetunji, E. O.
Oluleye, A. E.
SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, 2010, 21 (02): : 101 - 113
[49] Minimizing the total completion time in a two-machine flowshop problem with time delays
Msakni, Mohamed Kais
Khallouli, Wael
Al-Salem, Mohamed
Ladhari, Talel
ENGINEERING OPTIMIZATION, 2016, 48 (07) : 1164 - 1181
[50] New heuristics for minimising total completion time and the number of tardy jobs criteria on a single machine with release time
Oyetunji, E.O.
Oluleye, A.E.
South African Journal of Industrial Engineering, 2010, 21 (02) : 101 - 113

← 1 2 3 4 5 →