IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i1-2p444-459.html
   My bibliography  Save this article

Scheduling on identical machines with preemption and setup times

Author

Listed:
  • Amina Haned
  • Abida Kerdali
  • Mourad Boudhar

Abstract

In this paper, we address the problem of scheduling jobs on identical machines for minimising the maximum completion time (makespan). Each job requires a sequence-independent setup time, which represents the time needed to prepare the machines for job execution. Then, we introduce a dynamic programme to solve the case with two machines, and show that this problem admits a fully polynomial time approximation scheme. For the case of m machines, we propose heuristics and an adapted genetic algorithm. Some numerical experiments are done to evaluate the proposed algorithms.

Suggested Citation

  • Amina Haned & Abida Kerdali & Mourad Boudhar, 2024. "Scheduling on identical machines with preemption and setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 62(1-2), pages 444-459, January.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:1-2:p:444-459
    DOI: 10.1080/00207543.2023.2276825
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2276825
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2276825?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. Nadia Babou & Djamal Rebaine & Mourad Boudhar, 2024. "Solving the two-machine open shop problem with a single server with respect to the makespan," Annals of Operations Research, Springer, vol. 338(2), pages 857-877, July.

    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:62:y:2024:i:1-2:p:444-459. 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.