Please use this identifier to cite or link to this item: http://hdl.handle.net/10321/3414
Title: Parallel processors scheduling algorithms to minimise makespan in a galvanising plant
Authors: Dewa, Mendon
Nleya, Bakhe
Keywords: Makespan minimisation;Greedy genetic algorithm;Integer linear programming;Shortest processing time;Longest procressing time
Issue Date: Mar-2020
Publisher: Ponte Academic Journal
Source: Dewa, M. and Nleya, B. 2020. Parallel processors scheduling algorithms to minimise makespan in a galvanising plant. PONTE International Scientific Researches Journal. 76(3). Available: doi:10.21506/j.ponte.2020.3.18
Journal: PONTE International Scientific Researches Journal. Vol. 76, Issue 3 
Abstract: Galvanising lines consist of load/loading stations and a series of processing tanks that are generally energy-intensive. Each raw workpart 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 50 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.
URI: http://hdl.handle.net/10321/3414
DOI: 10.21506/j.ponte.2020.3.18
Appears in Collections:Research Publications (Engineering and Built Environment)

Files in This Item:
File Description SizeFormat
Dewa_PISRJ_Vol76#3_9Pgs_2020.pdf422.15 kBAdobe PDFView/Open
Show full item record

Page view(s)

61
checked on Aug 12, 2020

Download(s)

5
checked on Aug 12, 2020

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.