Title: A comparative representation approach to modern heuristic search methods in a job shop

Authors: P.D.D. Dominic, Ahmad Kamil Bin Mahmood, P. Parthiban, S.C. Lenny Koh

Addresses: Department of Computer and Information Sciences, Universiti Teknologi, Petronas, Tronoh, 31750 Perak, Malaysia. ' Department of Computer and Information Sciences, Universiti Teknologi, Petronas, Tronoh, 31750 Perak, Malaysia. ' Department of Production Engineering, National Institute of Technology, Tiruchirappalli 620015, Tamil Nadu, India. ' Logistics and Supply Chain Management (LSCM) Research Group, The University of Sheffield, Management School, 9 Mappin Street, Sheffield, S1 4DT, UK

Abstract: The job shop problem is among the class of non-deterministic polynomial time hard combinatorial problems. This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. The popular search techniques, such as the genetic algorithm and simulated annealing are used for the determination of the objectives like minimisations of the makespan time and mean flow time. Various rules, such as the SPT, LPT, MWKR and LWKR are used for the objective function to attain the results. The summary of results from this article gives a conclusion that the genetic algorithm gives better results in the makespan time determination on both the job-based representation and the rule-based representation and the simulated annealing algorithm gives the better results in the mean flow time in both the representations.

Keywords: genetic algorithms; GAs; job-based representation; job shop scheduling; rule-based representation; simulated annealing; mean flow time.

DOI: 10.1504/IJLEG.2008.023170

International Journal of Logistics Economics and Globalisation, 2008 Vol.1 No.3/4, pp.396 - 409

Published online: 12 Feb 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article