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 条
  • [31] An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
    Della Croce, F
    Ghirardi, M
    Tadei, R
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) : 293 - 301
  • [32] Minimising the makespan in the two-machine job shop problem under availability constraints
    Benttaleb, Mourad
    Hnaien, Faicel
    Yalaoui, Farouk
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (05) : 1427 - 1457
  • [33] Minimizing total completion time in two-machine flow shops with exact delays
    Huo, Yumei
    Li, Haibing
    Zhao, Hairong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 427 - +
  • [34] Minimizing total completion time in two-machine flow shops with exact delays
    Huo, Yumei
    Li, Holibing
    Zhao, Hairong
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 2018 - 2030
  • [35] An improved lower bound for the blocking permutation flow shop with total completion time criterion
    Nagano, Marcelo Seido
    Silva Robazzi, Joao Vitor
    Tomazella, Caio Paziani
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 146
  • [36] An assignment-based lower bound for a class of two-machine flow shop problems.
    Haouari, Mohamed
    Kharbeche, Mohamed
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (07) : 1693 - 1699
  • [37] Outsourcing and scheduling for a two-machine flow shop with release times
    Ahmadizar, Fardin
    Amiri, Zeinab
    ENGINEERING OPTIMIZATION, 2018, 50 (03) : 483 - 498
  • [38] Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
    Chen, JS
    Pan, JCH
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (12) : 757 - 766
  • [39] A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
    Kashyrskikh, KN
    Potts, CN
    Sevastianov, SV
    DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 255 - 271
  • [40] A new approach to two-machine flow shop problem with uncertain processing time
    Petrovic, S
    Song, XY
    ISUMA 2003: FOURTH INTERNATIONAL SYMPOSIUM ON UNCERTAINTY MODELING AND ANALYSIS, 2003, : 110 - 115
12345