Solving industrial multiprocessor task scheduling problems using an improved monkey search algorithm
by M.K. Marichelvam; M. Geetha
International Journal of Operational Research (IJOR), Vol. 41, No. 1, 2021

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.

Online publication date: Wed, 02-Jun-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com