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 条
  • [1] Lower bounds for minimizing total completion time in a two-machine flow shop
    Hoogeveen, Han
    van Norden, Linda
    van de Velde, Steef
    JOURNAL OF SCHEDULING, 2006, 9 (06) : 559 - 568
  • [2] Lower bounds for minimizing total completion time in a two-machine flow shop
    Han Hoogeveen
    Linda van Norden
    Steef van de Velde
    Journal of Scheduling, 2006, 9 : 559 - 568
  • [3] The two-machine total completion time flow shop problem
    DellaCroce, F
    Narayan, V
    Tadei, R
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 227 - 237
  • [4] New Approximation Algorithms for Two-machine Flow Shop Total Completion Time Problem
    Bai, Danyu
    Ren, Tao
    Li, Hongmei
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 2388 - 2392
  • [5] A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates
    Ardakan, Mostafa Abouei
    Hakimian, Ali
    Rezvan, Mohammad Taghi
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (06) : 519 - 528
  • [6] A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
    Rakrouki, Mohamed Ali
    Kooli, Anis
    Chalghoumi, Sabrine
    Ladhari, Talel
    OPERATIONAL RESEARCH, 2020, 20 (01) : 21 - 35
  • [7] A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
    Mohamed Ali Rakrouki
    Anis Kooli
    Sabrine Chalghoumi
    Talel Ladhari
    Operational Research, 2020, 20 : 21 - 35
  • [8] Minimizing total completion time in a two-machine flow shop with deteriorating jobs
    Wang, Ji-Bo
    Ng, C. T. Daniel
    Cheng, T. C. E.
    Liu, Li-Li
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (01) : 185 - 193
  • [9] A matheuristic approach for the two-machine total completion time flow shop problem
    Federico Della Croce
    Andrea Grosso
    Fabio Salassa
    Annals of Operations Research, 2014, 213 : 67 - 78
  • [10] Minimising makespan in the two-machine flow-shop with release times
    Tadei, R
    Gupta, JND
    Della Croce, F
    Cortesi, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (01) : 77 - 85
12345