A matheuristic approach for the two-machine total completion time flow shop problem

被引：22
|
作者：
Della Croce, Federico [1 ]
Grosso, Andrea [2 ]
Salassa, Fabio [1 ]
机构：
[1] Politecn Torino, DAI, Turin, Italy
[2] Univ Turin, Dip Informat, Turin, Italy
来源：
ANNALS OF OPERATIONS RESEARCH | 2014年 / 213卷 / 01期
关键词：
SEQUENCING PROBLEM; BOUND ALGORITHM; SEARCH;
D O I：
10.1007/s10479-011-0928-x
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper deals with the two-machine total completion time flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n (2)) variables and O(n) constraints.
引用
收藏
页码：67 / 78
页数：12
相关论文
共 50 条
  • [21] A new lower bound for minimising the total completion time in a two-machine flow shop under release dates
    Chalghoumi, Sabrine
    Mrad, Mehdi
    Ladhari, Talel
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [22] Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
    Bank, M.
    Ghomi, S. M. T. Fatemi
    Jolai, F.
    Behnamian, J.
    APPLIED MATHEMATICAL MODELLING, 2012, 36 (11) : 5418 - 5426
  • [23] The two-machine flow shop problem with conflict graphs
    Tellache, Nour El Houda
    Boudhar, Mourad
    IFAC PAPERSONLINE, 2016, 49 (12): : 1026 - 1031
  • [24] On the optimality conditions of the two-machine flow shop problem
    Hadda, Hatem
    Dridi, Najoua
    Hajji, Mohamed Karim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (02) : 426 - 435
  • [25] Stochastic two-machine flowshop scheduling problem with total completion time criterion
    Soroush, H.M.
    Allahverdi, A.
    International Journal of Industrial Engineering : Theory Applications and Practice, 2 (159-171):
  • [26] Stochastic two-machine flowshop scheduling problem with total completion time criterion
    Soroush, HM
    Allahverdi, A
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2005, 12 (02): : 159 - 171
  • [27] A new approach to two-machine flow shop problem with uncertain processing times
    Petrovic, Sanja
    Song, Xueyan
    OPTIMIZATION AND ENGINEERING, 2006, 7 (03) : 329 - 342
  • [28] A new approach to two-machine flow shop problem with uncertain processing times
    Sanja Petrovic
    Xueyan Song
    Optimization and Engineering, 2006, 7 : 329 - 342
  • [29] 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 - +
  • [30] Exact method for the two-machine flow-shop problem with time delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 375 - 406
12345