Optimisation of identical parallel machine scheduling problem
by Somasundaram Kamaraj; M. Saravanan
International Journal of Rapid Manufacturing (IJRAPIDM), Vol. 8, No. 1/2, 2019

Abstract: Scheduling is allocating the resources optimally over a period of time. The productivity and customer goodwill of the company increases by proper scheduling. This work focuses on scheduling of identical parallel machines (IPM) with an objective to makespan minimisation by using Grey Wolf Optimiser (GWO) algorithm. Makespan is the maximum completion time of all the jobs. In this work, the different jobs in different identical parallel machines are classified as experiments E1, E2, E3 and E4. These experiments were computationally solved by new metaheuristic GWO algorithm. The experimental computational results of GWO were compared with GA to obtain near optimal solution in all experiments.

Online publication date: Fri, 14-Dec-2018

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 Rapid Manufacturing (IJRAPIDM):
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