IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i9p1542-1554.html
   My bibliography  Save this article

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

Author

Listed:
  • Ju-Yong Lee

    (Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea)

  • Yeong-Dae Kim

    (Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea)

Abstract

This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported.

Suggested Citation

  • Ju-Yong Lee & Yeong-Dae Kim, 2015. "A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(9), pages 1542-1554, September.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:9:p:1542-1554
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/pdf/jors2014122a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/full/jors2014122a.html
    File Function: Link to full text HTML
    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.

    Citations

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


    Cited by:

    1. Herr, Oliver & Goel, Asvin, 2016. "Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints," European Journal of Operational Research, Elsevier, vol. 248(1), pages 123-135.
    2. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.

    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:pal:jorsoc:v:66:y:2015:i:9:p:1542-1554. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.