Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes

被引：3

作者：

Berghman, Lotte ^{[1
]}

Spieksma, Frits C. R. ^{[2
]}

T'kindt, Vincent ^{[3
]}

机构：

[1] TBS Business Sch, 20 BD Lascrosses BP 7010, F-31068 Toulouse 7, France

[2] TU Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

[3] Univ Tours, Lab Informat Fondamentale & Appl EA 6300, ERL CNRS 7002 ROOT, 64 Ave Jean Portalis, F-37200 Tours, France

来源：

RAIRO-OPERATIONS RESEARCH | 2021年 / 55卷

关键词：

Unrelated machine scheduling; time-indexed formulation; valid inequalities; cutting plane algorithm; variable fixing;

D O I：

10.1051/ro/2020031

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We present new facet-inducing valid inequalities and a preprocessing technique involving fixing variables based on reduced costs. We combine both techniques in a basic cutting-plane algorithm and test the performance of the resulting algorithm by running it on randomly generated instances.

引用

页码：S1747 / S1765

页数：19

共 50 条

[41] A robust optimization approach for the unrelated parallel machine scheduling problem
Jonathan De La Vega
Alfredo Moreno
Reinaldo Morabito
Pedro Munari
[J]. TOP, 2023, 31 : 31 - 66
[42] A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine
Ze-wen Sun
Xing-sheng Gu
[J]. Journal of Central South University, 2017, 24 : 1779 - 1788
[43] A TIME INDEXED FORMULATION OF NONPREEMPTIVE SINGLE-MACHINE SCHEDULING PROBLEMS
SOUSA, JP
WOLSEY, LA
[J]. MATHEMATICAL PROGRAMMING, 1992, 54 (03) : 353 - 367
[44] A new genetic algorithm in solving the unrelated parallel machines scheduling problem
Chen, L
Gao, JM
[J]. THIRD INTERNATIONAL CONFERENCE ON ELECTRONIC COMMERCE ENGINEERING: DIGITAL ENTERPRISES AND NONTRADITIONAL INDUSTRIALIZATION, 2003, : 154 - 156
[45] A strengthened formulation and cutting planes for the open pit mine production scheduling problem
Bley, Andreas
Boland, Natashia
Fricke, Christopher
Froyland, Gary
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) : 1641 - 1647
[46] Unrelated parallel-machine scheduling with controllable processing time
Hsu, Chia-Lun
Taur, Jin-Shiuh
[J]. MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4, 2013, 321-324 : 1993 - +
[47] Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search
Haddad, Matheus N.
Cota, Luciano P.
Souza, Marcone J. F.
Maculan, Nelson
[J]. ENTERPRISE INFORMATION SYSTEMS, ICEIS 2014, 2015, 227 : 131 - 148
[48] Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems
Al-qaness, Mohammed A. A.
Ewees, Ahmed A.
Abd Elaziz, Mohamed
[J]. SOFT COMPUTING, 2021, 25 (14) : 9545 - 9557
[49] A fix-and-optimize heuristic for the Unrelated Parallel Machine Scheduling Problem
Fonseca, George H. G.
Figueiroa, Guilherme B.
Toffolo, Tulio A. M.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 163
[50] Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems
Mohammed A. A. Al-qaness
Ahmed A. Ewees
Mohamed Abd Elaziz
[J]. Soft Computing, 2021, 25 : 9545 - 9557

← 1 2 3 4 5 →