Minimising total weighted tardiness with considering compulsory idle times on a single machine

Hossein Zoulfaghari and Javad Nematian

International Journal of Operational Research, 2019, vol. 35, issue 3, 340-354

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.

Keywords: total weighted tardiness; single machine; compulsory idle time; variable restricted neighbourhood search; VRNS. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101198 (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:35:y:2019:i:3:p:340-354

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 ().