Ponte Academic Journal Mar 2020, Volume 76, Issue 3 |
PARALLEL PROCESSORS SCHEDULING ALGORITHMS TO MINIMISE MAKESPAN IN A GALVANISING PLANT Author(s): Mendon Dewa ,Bakhe Nleya J. Ponte - Mar 2020 - Volume 76 - Issue 3 doi: 10.21506/j.ponte.2020.3.18 Abstract: Galvanising lines consists of load/loading stations and a series of processing tanks that are generally energy-intensive. Each raw part needs to go through a number of processing stages sequentially. Job sizes and processing time vary from part to part, hence the need to derive an optimal schedule to minimise total processing time in a batch. The problem of minimizing the makespan on parallel processing machines using different scheduling algorithms is studied in this paper. A set of independent tasks were scheduled on parallel processors in order to minimize schedule length using Integer Linear Programming, Shortest Processing Time, Longest Processing Time, and Greedy Genetic algorithms. The experimental results demonstrated that our Greedy Genetic algorithm outperformed other algorithms on minimizing makespan on parallel processing machines.
|
Download full text: Check if you have access through your login credentials or your institution |
|
Guide for Authors
This guideline has been prepared for the authors to new submissions and after their manuscripts have been accepted |
Authors Login
We welcome refrees who would be willing to act as reviewers |
Paper Tracking
You can track your submitted article from this tab |
Editorial Board
The international editorial board is headed by Dr. Maria E. Boschi |
General Policies
Papers that are published or held by the Journal may not be published elsewhere |
Peer Review Process
Papers will be sent to three peer reviewers for evaluation |