Back to Search
Start Over
An iterated greedy metaheuristic for the blocking job shop scheduling problem.
- Source :
- Journal of Heuristics; Aug2016, Vol. 22 Issue 4, p587-611, 25p
- Publication Year :
- 2016
-
Abstract
- In this paper we consider a job shop scheduling problem with blocking (BJSS) constraints. Blocking constraints model the absence of buffers (zero buffer), whereas in the traditional job shop scheduling model buffers have infinite capacity. There are two known variants of this problem, namely the blocking job shop scheduling with swap allowed (BWS) and the one with no swap allowed (BNS). This scheduling problem is receiving an increasing interest in the recent literature, and we propose an Iterated Greedy (IG) algorithm to solve both variants of the problem. IG is a metaheuristic based on the repetition of a destruction phase, which removes part of the solution, and a construction phase, in which a new solution is obtained by applying an underlying greedy algorithm starting from the partial solution. A comparison with recent published results shows that the iterated greedy algorithm outperforms other state-of-the-art algorithms on benchmark instances. Moreover it is conceptually easy to implement and has a broad applicability to other constrained scheduling problems. [ABSTRACT FROM AUTHOR]
- Subjects :
- JOB shops
JOB orders
MANUFACTURING cells
SCHEDULING
METAHEURISTIC algorithms
Subjects
Details
- Language :
- English
- ISSN :
- 13811231
- Volume :
- 22
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Journal of Heuristics
- Publication Type :
- Academic Journal
- Accession number :
- 116918352
- Full Text :
- https://doi.org/10.1007/s10732-014-9279-5