Using two metaheuristic algorithms for scheduling parallel machines with sequence dependent set-up times in job shop industries

Ghorbanali Mohammadi and Erfan Moaddabi

International Journal of Systems Science, 2021, vol. 52, issue 14, 2904-2917

Abstract: Nowadays, scheduling problem in the field of production planning has been considered by many researchers and this issue is used in various industries. Using the same parallel machines reduces the queue of WIP behind the machine and also increases production. Since scheduling problems in large scale are NP-hard, to solve them, metaheuristic algorithms are used. In this paper, Ant colony optimisation and Harmony Search algorithm are used to solve the problem as well as comparison with two other algorithms and finally, their performance is analysed and the efficient algorithm is investigated.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2021.1913534 (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:taf:tsysxx:v:52:y:2021:i:14:p:2904-2917

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20

DOI: 10.1080/00207721.2021.1913534

Access Statistics for this article

International Journal of Systems Science is currently edited by Visakan Kadirkamanathan

More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().