IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v41y2021i2p270-281.html
   My bibliography  Save this article

Worm optimisation algorithm to minimise the makespan for the two-machine scheduling problem with a single server

Author

Listed:
  • Jean-Paul Arnaout

Abstract

This paper considers the problem of scheduling a given set of jobs on two identical parallel machines. Each job must be processed on one of the machines, and prior to processing, the job is set up on its machine using one server; the latter is shared between the two machines. This problem is known as the two-machine scheduling problem with a single server, and our objective is to minimise the makespan. A worm optimisation algorithm (WO) is introduced for this NP-hard problem, and its performance is compared to ant colony optimisation, simulated annealing, and genetic algorithm, as well as exact approach. The superiority of WO over the other algorithms is obtained through extensive computational results.

Suggested Citation

  • Jean-Paul Arnaout, 2021. "Worm optimisation algorithm to minimise the makespan for the two-machine scheduling problem with a single server," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 41(2), pages 270-281.
    • Handle: RePEc:ids:ijores:v:41:y:2021:i:2:p:270-281
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=115628
    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.

    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:ids:ijores:v:41:y:2021:i:2:p:270-281. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.