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 条

[11] Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time
He, Ning
Qiao, Yan
Wu, NaiQi
Qu, Ting
ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (03) : 1 - 12
[12] A new approach to two-machine flow shop problem with uncertain processing time
Petrovic, S
Song, XY
ISUMA 2003: FOURTH INTERNATIONAL SYMPOSIUM ON UNCERTAINTY MODELING AND ANALYSIS, 2003, : 110 - 115
[13] Minimizing the total flow time and the tardiness in a two-machine flow shop
Lee, WC
Wu, CC
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2001, 32 (03) : 365 - 373
[14] A bicriteria approach to the two-machine flow shop scheduling problem
Sayin, S
Karabati, S
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (02) : 435 - 449
[15] Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Hwang, F. J.
Kovalyov, M. Y.
Lin, B. M. T.
DISCRETE OPTIMIZATION, 2012, 9 (01) : 29 - 39
[16] Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Wei, Hongjun
Yuan, Jinjiang
OPERATIONS RESEARCH LETTERS, 2019, 47 (01) : 41 - 46
[17] Minimizing the total completion time in a two-machine flowshop problem with time delays
Msakni, Mohamed Kais
Khallouli, Wael
Al-Salem, Mohamed
Ladhari, Talel
ENGINEERING OPTIMIZATION, 2016, 48 (07) : 1164 - 1181
[18] Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
Mkadem, Mohamed Amine
Moukrim, Aziz
Serairi, Mehdi
OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 527 - 533
[19] Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
Cheng, Mingbao
Tadikamalla, Pandu R.
Shang, Jennifer
Zhang, Bixi
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (05) : 709 - 719
[20] Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
Yang, Shu-Hui
Wang, Ji-Bo
APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (09) : 4819 - 4826

← 1 2 3 4 5 →