High Performance Algorithms for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times

被引：0

作者：

Hadhbi, Youssouf ^{[1
]}

Deroussi, Laurent ^{[1
]}

Grangeon, Nathalie ^{[1
]}

Norre, Sylvie ^{[1
]}

Blanchon, Christophe ^{[2
]}

机构：

[1] Univ Clermont Auvergne, CNRS, Clermont Auvergne INP, Mines St Etienne,LIMOS, F-63000 Clermont Ferrand, France

[2] Inoprod, F-63800 Cournon Dauvergne, France

来源：

METAHEURISTICS AND NATURE INSPIRED COMPUTING, META 2023 | 2024年 / 2016卷

关键词：

unrelated parallel machines scheduling problem; sequence-dependent setup times; servers; mixed integer linear program; branch-and-cut; local search; iterated local search; matheuristic; APPROXIMATION ALGORITHMS; MAKESPAN;

D O I：

10.1007/978-3-031-69257-4_6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we study a variant of the non-preemptive unrelated parallel machines scheduling problem with sequence-dependent setup times and machine eligibility restrictions. We first formulate the problem as a mixed integer linear program (MILP), and further devise a branch-and-cut (B&C) algorithm for solving the problem. Due to the NP hardness of the problem, we propose a metaheuristic based on an iterated local search (ILS) algorithm. Using this, we provide several matheuristics for solving the problem. The proposed approaches are compared using different families of instances.

引用

页码：71 / 88

页数：18

共 50 条

[31] Job-shop scheduling problem with sequence dependent setup times
Moghaddas, R.
Houshmand, M.
IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 1546 - 1552
[32] Makespan minimization for scheduling unrelated parallel machines with setup times
Ying, Kuo-Ching
Lee, Zne-Jung
Lin, Shih-Wei
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) : 1795 - 1803
[33] Makespan minimization for scheduling unrelated parallel machines with setup times
Kuo-Ching Ying
Zne-Jung Lee
Shih-Wei Lin
Journal of Intelligent Manufacturing, 2012, 23 : 1795 - 1803
[34] Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times
Perez-Gonzalez, Paz
Fernandez-Viagas, Victor
Zamora Garcia, Miguel
Framinan, Jose M.
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 131 : 131 - 145
[35] Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
Zne-Jung Lee
Shih-Wei Lin
Kuo-Ching Ying
The International Journal of Advanced Manufacturing Technology, 2010, 47 : 773 - 781
[36] Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
Lee, Zne-Jung
Lin, Shih-Wei
Ying, Kuo-Ching
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 47 (5-8): : 773 - 781
[37] Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent-Machine-Dependent Setup Time Problem
Isaac Vazquez-Serrano, Jesus
Eduardo Cardenas-Barron, Leopoldo
Peimbert-Garcia, Rodrigo E.
MATHEMATICS, 2021, 9 (22)
[38] Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
Kim, Hyun-Jung
Lee, Jun-Ho
COMPUTERS & OPERATIONS RESEARCH, 2021, 126
[39] A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times
Costa, A. (costa@diim.unict.it), 1600, Springer London (69): : 9 - 12
[40] A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times
Costa, A.
Cappadonna, F. A.
Fichera, S.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 69 (9-12): : 2799 - 2817

← 1 2 3 4 5 →