IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v35y2019i3p340-354.html
   My bibliography  Save this article

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

Author

Listed:
  • Hossein Zoulfaghari
  • Javad Nematian

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.

Suggested Citation

  • Hossein Zoulfaghari & Javad Nematian, 2019. "Minimising total weighted tardiness with considering compulsory idle times on a single machine," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 35(3), pages 340-354.
  • Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:340-354
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=101198
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:340-354. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.