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

被引：23

作者：

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

共 22 条

[1] The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm [J].

Akkan, C ;

Karabati, S .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (02) :420-429

[2]

Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160

[3]

Boschetti M, 2009, ANN INFORM SYST, V10, P135, DOI 10.1007/978-1-4419-1306-7_5

[4] Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum [J].

Czapinski, Michal .

COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (04) :778-785

[5] Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems [J].

Della Croce, F ;

Ghirardi, M ;

Tadei, R .

JOURNAL OF HEURISTICS, 2004, 10 (01) :89-104

[6] An improved branch-and-bound algorithm for the two machine total completion time flow shop problem [J].

Della Croce, F ;

Ghirardi, M ;

Tadei, R .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) :293-301

[7]

Della Croce F., 2008, PATAT 2010 P 8 INT C, P167

[8]

Della Croce F, 2011, LECT NOTES COMPUT SC, V6622, P38, DOI 10.1007/978-3-642-20364-0_4

[9] The two-machine total completion time flow shop problem [J].

DellaCroce, F ;

Narayan, V ;

Tadei, R .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) :227-237

[10] An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion [J].

Dong, Xingye ;

Huang, Houkuan ;

Chen, Ping .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1664-1669

← 1 2 3 →