IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i2p444-457.html
   My bibliography  Save this article

Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times

Author

Listed:
  • João Marcos Pereira Silva
  • Ewerton Teixeira
  • Anand Subramanian

Abstract

We consider the problem of scheduling parallel machines with a common server and sequence-dependent setup times, whose objective is to minimize the makespan. In this case, the common server, which can be a machine, individual or a team, is responsible for performing the setup operations. Therefore, there must be no conflicts while conducting them. An arc-time-indexed formulation is proposed for the problem, as well as an algorithm based on the metaheuristic iterated local search that makes use of an improved decoding algorithm. Computational experiments were carried out on 150 instances involving up to 100 jobs ranging from 2 to 10 machines. The results obtained suggest that the methods developed were capable of finding highly competitive solutions when compared to those achieved by existing approaches.

Suggested Citation

  • João Marcos Pereira Silva & Ewerton Teixeira & Anand Subramanian, 2021. "Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(2), pages 444-457, February.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:2:p:444-457
    DOI: 10.1080/01605682.2019.1671153
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1671153
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1671153?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. Morais, Rafael & Bulhões, Teobaldo & Subramanian, Anand, 2024. "Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates," European Journal of Operational Research, Elsevier, vol. 315(2), pages 442-453.

    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:tjorxx:v:72:y:2021:i:2:p:444-457. 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/tjor .

    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.