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 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem
    Della Croce, Federico
    Grosso, Andrea
    Salassa, Fabio
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, 2011, 6622 : 38 - +
  • [5] 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
  • [6] 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
  • [7] 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
  • [8] Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
    Federico Della Croce
    Andrea Grosso
    Fabio Salassa
    Journal of Heuristics, 2021, 27 : 159 - 173
  • [9] Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
    Della Croce, Federico
    Grosso, Andrea
    Salassa, Fabio
    JOURNAL OF HEURISTICS, 2021, 27 (1-2) : 159 - 173
  • [10] Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
    Choi, BC
    Yoon, SH
    Chung, SJ
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (04) : 715 - 728
12345