loading
Documents

Research.Publish.Connect.

Paper

Authors: Marek Vlk 1 ; Antonin Novak 2 and Zdenek Hanzalek 3

Affiliations: 1 Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Czech Republic, Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic ; 2 Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic, Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic ; 3 Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic

ISBN: 978-989-758-352-0

Keyword(s): Human Resource Scheduling, Common Setup Operator, Constraint Programming, Hybrid Heuristic.

Abstract: This paper deals with a scheduling problem that emerges in the production of water tubes of different sizes that require reconfiguration of the machines. The reconfiguration of the machines leads to the notion of sequence-dependent setup times between tasks. These setups are often performed by a single person who cannot serve more than one machine at the same moment, i.e., the setups must not overlap. Surprisingly, the problem with non-overlapping setups has received only a little attention so far. To solve this problem, we propose an Integer Linear Programming formulation, Constraint Programming models and a hybrid heuristic that leverages the strength of Integer Linear Programming in the shortest Hamiltonian path problem and the efficiency of Constraint Programming at sequencing problems with makespan minimization. The experimental evaluation shows that among the proposed exact approaches, the Constraint Programming is a superior method being able to solve instances with 3 machines and up to 11 tasks on each machine to optimality within a few seconds. The proposed hybrid heuristic attains high-quality solutions for instances with 50 machines and up to 116 tasks on each machine. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.211.135.32

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Vlk, M.; Novak, A. and Hanzalek, Z. (2019). Makespan Minimization with Sequence-dependent Non-overlapping Setups.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 91-101. DOI: 10.5220/0007362700910101

@conference{icores19,
author={Marek Vlk. and Antonin Novak. and Zdenek Hanzalek.},
title={Makespan Minimization with Sequence-dependent Non-overlapping Setups},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={91-101},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007362700910101},
isbn={978-989-758-352-0},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Makespan Minimization with Sequence-dependent Non-overlapping Setups
SN - 978-989-758-352-0
AU - Vlk, M.
AU - Novak, A.
AU - Hanzalek, Z.
PY - 2019
SP - 91
EP - 101
DO - 10.5220/0007362700910101

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.