Solving industrial multiprocessor task scheduling problems using an improved monkey search algorithm. (24th May 2021)

• Record Type: Journal Article
• Authors: Marichelvam, M.K.; Geetha, M.
• Is Part Of: International journal of operational research. Volume 41:Number 1(2021)
• Page Start: 135
• Page End: 149
• Publication Date: 2021-05-24
• Subjects: scheduling -- hybrid flowshop -- HFS -- multiprocessor tasks scheduling -- NP-hard -- monkey search algorithm -- MSA -- makespan; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

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.