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 条
  • [21] Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
    Della Croce, Federico
    Grosso, Andrea
    Salassa, Fabio
    JOURNAL OF HEURISTICS, 2021, 27 (1-2) : 159 - 173
  • [22] Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
    Hwang, F. J.
    Kovalyov, M. Y.
    Lin, B. M. T.
    DISCRETE OPTIMIZATION, 2012, 9 (01) : 29 - 39
  • [23] Minimizing the Total Completion Time in a Two-machine Flowshop with Release Times
    Gong, Hua
    Chen, Daheng
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 4136 - 4140
  • [24] Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
    Wei, Hongjun
    Yuan, Jinjiang
    OPERATIONS RESEARCH LETTERS, 2019, 47 (01) : 41 - 46
  • [25] Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 527 - 533
  • [26] Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
    Cheng, Mingbao
    Tadikamalla, Pandu R.
    Shang, Jennifer
    Zhang, Bixi
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (05) : 709 - 719
  • [27] Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
    Lv, Dan-Yang
    Wang, Ji-Bo
    ENGINEERING OPTIMIZATION, 2024,
  • [28] Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop
    Ladhari, Tale
    Rakrouki, Mohamed Ali
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2009, 122 (02) : 678 - 691
  • [29] The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
    Akkan, C
    Karabati, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (02) : 420 - 429
  • [30] Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
    Park, Myoung-Ju
    Choi, Byung-Cheon
    Min, Yunhong
    Kim, Kyung Min
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2020, 37 (01)
12345