Optimisation of identical parallel machine scheduling problem

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.

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

“…Another heuristic approach was proposed by [8] after careful analysis of the classical LPT performance. Another approach taken was by applying the approximation method [9], metaheuristics such as Particle Swarm Optimization [10] and Grey Wolf Optimizer [11], and simulation [12]. While this research shows promising performance, they only consider single-stage jobs.…”