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

An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance

Author

Listed:
  • Ming Liu
  • Shijin Wang
  • Chengbin Chu
  • Feng Chu

Abstract

In this paper, we investigate a single-machine scheduling problem with periodic maintenance, which is motivated by various industrial applications (e.g. tool changes). The pursued objective is to minimise the number of tardy jobs, because it is one of the important criteria for the manufacturers to avoid the loss of customers. The strong NP-hardness of the problem is shown. To improve the state-of-the-art exact algorithm, we devise a new branch-and-bound algorithm based on an efficient lower bounding procedure and several new dominance properties. Numerical experiments are conducted to demonstrate the efficiency of our exact algorithm.

Suggested Citation

  • Ming Liu & Shijin Wang & Chengbin Chu & Feng Chu, 2016. "An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3591-3602, June.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:12:p:3591-3602
    DOI: 10.1080/00207543.2015.1108535
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1108535
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1108535?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hejl, Lukáš & Šůcha, Přemysl & Novák, Antonín & Hanzálek, Zdeněk, 2022. "Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances," European Journal of Operational Research, Elsevier, vol. 298(2), pages 413-424.
    2. Ming Liu & Hao Tang & Yunfeng Wang & Ruixi Li & Yi Liu & Xin Liu & Yaqian Wang & Yiyang Wu & Yu Wu & Zhijun Sun, 2023. "Enhancing Food Supply Chain in Green Logistics with Multi-Level Processing Strategy under Disruptions," Sustainability, MDPI, vol. 15(2), pages 1-21, January.
    3. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.

    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:54:y:2016:i:12:p:3591-3602. 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.