Loading...
Loading...

Go to the content (press return)

An efficient iterated local search algorithm for the total tardiness blocking flow shop problem

Author
Ribas, I.; Companys, R.; Tort-Martorell, J.
Type of activity
Journal article
Journal
International journal of production research
Date of publication
2013-04-27
Volume
51
Number
17
First page
5238
Last page
5252
DOI
https://doi.org/10.1080/00207543.2013.802390 Open in new window
Repository
http://hdl.handle.net/2117/19622 Open in new window
URL
http://dx.doi.org/10.1080/00207543.2013.802390 Open in new window
Abstract
This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes use of a NEHbased procedure to generate the initial solution, and uses a local search to intensify the exploration that combines the insertion and swap neighbourhood and uses a perturbation mechanism consisting of three neighbourhood operators to diversify the search. The computa...
Citation
Ribas, I.; Companys , R.; Tort-martorell, J. An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. "International journal of production research", 27 Abril 2013, p. 1-16.
Keywords
blocking flow shop, heuristics, iterated local search, scheduling, tardiness, variable local search
Group of research
ADBD - Analysis of Complex Data for Business Decisions
SCOM - Supply Chain and Operations Management

Participants