IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v29y2015i5-6p271-287.html
   My bibliography  Save this article

An improved MIP-based approach to minimise total earliness and tardiness in unrelated parallel machines scheduling with machine idle time

Author

Listed:
  • Chi-Yang Tsai
  • Yi-Chen Wang

Abstract

This paper proposes an effective and efficient mixed integer linear programming (MIP) formulation of the unrelated parallel machine scheduling problem with the objective of minimising total earliness and tardiness (ET) and explores how scheduling performance can be improved by allowing machine idle time. In addition, four simple dispatching rules are utilised to improve solution efficiency. From the results of experiments, it is found that: 1) the improved MIP formulation fixes a potential problem of existing models in literature; 2) the ET value can be significantly reduced if machine idle time is properly allowed before jobs; 3) the utilised dispatching rules yield comparable efficient and quality solutions.

Suggested Citation

  • Chi-Yang Tsai & Yi-Chen Wang, 2015. "An improved MIP-based approach to minimise total earliness and tardiness in unrelated parallel machines scheduling with machine idle time," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 29(5/6), pages 271-287.
    • Handle: RePEc:ids:ijmtma:v:29:y:2015:i:5/6:p:271-287
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=71220
    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:ijmtma:v:29:y:2015:i:5/6:p:271-287. 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=21 .

    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.