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 条
  • [31] Exact method for the two-machine flow-shop problem with time delays
    Mohamed Amine Mkadem
    Aziz Moukrim
    Mehdi Serairi
    Annals of Operations Research, 2021, 298 : 375 - 406
  • [32] Analysis of heuristics for the UET two-machine flow shop problem with time delays
    Rayward-Smith, V. J.
    Rebaine, D.
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3298 - 3310
  • [33] 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
  • [34] 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
  • [35] A two-machine permutation flow shop scheduling problem with buffers
    Czesław Smutnicki
    Operations-Research-Spektrum, 1998, 20 : 229 - 235
  • [36] Two-machine flow shop scheduling problem with an outsourcing option
    Choi, Byung-Cheon
    Chung, Jibok
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (01) : 66 - 72
  • [37] Inverse scheduling: two-machine flow-shop problem
    Peter Brucker
    Natalia V. Shakhlevich
    Journal of Scheduling, 2011, 14 : 239 - 256
  • [38] Cyclic flow shop scheduling problem with two-machine cells
    Bozejko, Wojciech
    Gnatowski, Andrzej
    Idzikowski, Radoslaw
    Wodecki, Mieczyslaw
    ARCHIVES OF CONTROL SCIENCES, 2017, 27 (02): : 151 - 167
  • [39] On two-machine Flow Shop Scheduling Problem with disjoint setups
    Gnatowski, Andrzej
    Rudy, Jaroslaw
    Idzikowski, Radoslaw
    2020 IEEE 15TH INTERNATIONAL CONFERENCE OF SYSTEM OF SYSTEMS ENGINEERING (SOSE 2020), 2020, : 277 - 282
  • [40] A two-machine permutation flow shop scheduling problem with buffers
    Smutnicki, C
    OR SPEKTRUM, 1998, 20 (04) : 229 - 235
12345