Title: Scheduling identical parallel machine with unequal job release time to minimise total flow time
Authors: Zubair Ahmed; Tarek Y. Elmekkawy
Addresses: Department of Mechanical and Manufacturing Engineering, University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada ' Department of Mechanical and Manufacturing Engineering, University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada
Abstract: This paper addresses the identical parallel machine scheduling problem with unequal jobs release date to minimise the total flow time. An efficient heuristic algorithm was proposed, known as modified forward heuristic algorithm. The algorithm starts with developing a priority list of all jobs. This list is used to develop sub-schedules for each machine based on some propositions related to the jobs processing and release times with allowing delay schedule. A mathematical model of the problem was also developed. The performance of the algorithm was evaluated by comparing its solutions with the optimal solutions of small test cases obtained from the developed mathematical model. Then, the results of large problems were compared with the results of the best reported heuristics in the literature. In addition to the simplicity of the proposed algorithm, these comparisons showed that the proposed algorithm can obtain solutions that are very close to the optimum solutions and better than the other heuristics.
Keywords: identical parallel machines; unequal job release; heuristics; total flow time; parallel machine scheduling; mathematical modelling.
International Journal of Industrial and Systems Engineering, 2013 Vol.13 No.4, pp.409 - 423
Available online: 14 Mar 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article