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

Jean-Paul Arnaout

International Journal of Operational Research, 2021, vol. 41, issue 2, 270-281

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.

Keywords: worm optimisation; parallel machines; single server. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=115628 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:41:y:2021:i:2:p:270-281

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().