A tabu search algorithm for no-wait job shop scheduling problem

Ghafour Ahani and Mostafa Asyabani

International Journal of Operational Research, 2014, vol. 19, issue 2, 246-258

Abstract: In this paper, we consider no-wait job shop scheduling problem with makespan objective. In the no-wait problem two consecutive operations in each job must be processed without any interruption. No-wait job shop problem is strongly NP-hard. Mascis and Pacciarelli proposed an algorithm for no-wait job shop problem that produces good quality solution for benchmark problems but it mostly failed in finding a feasible solution. Therefore, we introduce a new neighbourhood structure in our tabu search to resolve this problem.

Keywords: no-wait scheduling; job shop scheduling; tabu search; alternative graph; makespan. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=58954 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:19:y:2014:i:2:p:246-258

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().