Solving industrial multiprocessor task scheduling problems using an improved monkey search algorithm

M.K. Marichelvam and M. Geetha

International Journal of Operational Research, 2021, vol. 41, issue 1, 135-149

Abstract: This paper addresses multiprocessor task scheduling in a multistage hybrid flowshop environment which has been proved to be strongly NP-hard. An improved monkey search algorithm (IMSA) is proposed to solve this problem. The objective is to minimise the makespan which is the completion time of all the tasks in the last stage. The proposed algorithm is tested with three types of problems. A real industrial data is first used. Then, random problem instances are generated and finally, the benchmark problems addressed in literature are also considered. In all the three cases, the results are compared with earlier reported algorithms in the literature and the computational results reveal that the proposed algorithm is competent.

Keywords: scheduling; hybrid flowshop; HFS; multiprocessor tasks scheduling; NP-hard; monkey search algorithm; MSA; makespan. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=115418 (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:1:p:135-149

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 ().