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

GRASP algorithms for the unrelated parallel machines scheduling problem with additional resources during processing and setups

Author

Listed:
  • Axel Lopez-Esteve
  • Federico Perea
  • Juan C. Yepes-Borrero

Abstract

This paper addresses an unrelated parallel machines scheduling problem with the need of additional resources during the processing of the jobs, as well as during the setups that machines need between the processing of any two jobs. This problem is highly complex, and therefore in this paper we propose several constructive heuristics to solve it. To improve the performance of these heuristics, we propose several variations, including randomisation with different probability distributions and a local search phase, having this way GRASP algorithms. The results of extensive experiments over randomly generated instances show several findings on the different parameters that characterise our constructive algorithms. In particular, we highlight the fact that non-uniform probability distributions might be advisable for choosing elements of a restricted candidate list in GRASP algorithms.

Suggested Citation

  • Axel Lopez-Esteve & Federico Perea & Juan C. Yepes-Borrero, 2023. "GRASP algorithms for the unrelated parallel machines scheduling problem with additional resources during processing and setups," International Journal of Production Research, Taylor & Francis Journals, vol. 61(17), pages 6013-6029, September.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:17:p:6013-6029
    DOI: 10.1080/00207543.2022.2121869
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2121869
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2121869?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:61:y:2023:i:17:p:6013-6029. 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.