Minimising total weighted tardiness with considering compulsory idle times on a single machine
by Hossein Zoulfaghari; Javad Nematian
International Journal of Operational Research (IJOR), Vol. 35, No. 3, 2019

Abstract: In this paper, we introduce a total weighted tardiness minimisation problem of single machine system with considering compulsory idle times of a machine (such as maintenance operations, etc.). Then, the problem is solved by using a variable restricted neighbourhood search approach. In this approach, an algorithm has been designed in which some special methods are used to produce and improve good initial solution. To represent our algorithm performance, 200 instances with small and medium sizes and 200 instances with large sizes are solved and their results have been achieved in favour of minimisation of weighted total tardiness. Furthermore, special relations operated based on a factor are used to produce instances and obtained results are investigated.

Online publication date: Mon, 29-Jul-2019

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