A tabu search algorithm for no-wait job shop scheduling problem
by Ghafour Ahani; Mostafa Asyabani
International Journal of Operational Research (IJOR), Vol. 19, No. 2, 2014

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.

Online publication date: Sat, 25-Jan-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com