IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i6p1707-1719.html
   My bibliography  Save this article

Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window

Author

Listed:
  • Kuo-Ching Ying
  • Shih-Wei Lin
  • Chung-Cheng Lu

Abstract

This study addresses the single-machine scheduling problem with a common due window (CDW) that has a constant size and position. The objective is to minimise the total weighted earliness–tardiness penalties for jobs completed out of the CDW. To determine a schedule as close to optimum as possible, this study develops a dynamic dispatching rule and an effective constructive heuristic. The better performance of the proposed heuristic is demonstrated by comparing the results of it with those of a state-of-the-art greedy heuristic on a well-known benchmark problem set. In addition, we incorporate the constructive heuristic into a best-so-far meta-heuristic to examine the benefit of the proposed heuristic. The results show that the best known solutions in 144 out of the 250 benchmark instances are improved.

Suggested Citation

  • Kuo-Ching Ying & Shih-Wei Lin & Chung-Cheng Lu, 2017. "Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1707-1719, March.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:6:p:1707-1719
    DOI: 10.1080/00207543.2016.1224949
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1224949
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1224949?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:55:y:2017:i:6:p:1707-1719. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.