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 条
  • [41] Two-machine flow shop problem with effects of deterioration and learning
    Wang, Ji-Bo
    Liu, Li-Li
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (03) : 1114 - 1121
  • [42] Inverse scheduling: two-machine flow-shop problem
    Brucker, Peter
    Shakhlevich, Natalia V.
    JOURNAL OF SCHEDULING, 2011, 14 (03) : 239 - 256
  • [43] Two-machine flow shop problem with unit-time operations and conflict graph
    Tellache, Nour El Houda
    Boudhar, Mourad
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (06) : 1664 - 1679
  • [44] On two-machine stochastic flow shop
    Wermus, M
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 1390 - 1392
  • [45] On Two-machine Flow Shop Scheduling
    Chen L.
    Luo W.-C.
    Zhang G.-C.
    Journal of the Operations Research Society of China, 2014, 2 (03) : 333 - 339
  • [46] Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
    Aydilek, Harun
    Allahverdi, Ali
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 59 (02) : 684 - 693
  • [47] Minimizing total flow time in a two-machine flowshop problem with minimum makespan
    Gupta, JND
    Neppalli, VR
    Werner, F
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 69 (03) : 323 - 338
  • [48] A Two-Machine Flowshop Scheduling Problem with a Job Precedence Constraint to Minimize the Total Completion Time
    Xu, Jianyou
    Lin, Win-Chin
    Yin, Yunqiang
    Cheng, Yu
    Wu, Chin-Chia
    JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2017, 76 (12): : 761 - 766
  • [49] 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
  • [50] Three heuristic procedures for the stochastic, two-machine flow shop problem
    Kenneth R. Baker
    Dan Trietsch
    Journal of Scheduling, 2011, 14 : 445 - 454
12345