Please use this identifier to cite or link to this item:
Title: An improved Intelligent Water Drops algorithm for achieving optimal job-shop scheduling solutions
Authors: Niu, S.H.
Ong, S.K. 
Nee, A.Y.C. 
Keywords: Intelligent Water Drops (IWD)
job-shop scheduling
makespan optimisation
Issue Date: 1-Aug-2012
Citation: Niu, S.H., Ong, S.K., Nee, A.Y.C. (2012-08-01). An improved Intelligent Water Drops algorithm for achieving optimal job-shop scheduling solutions. International Journal of Production Research 50 (15) : 4192-4205. ScholarBank@NUS Repository.
Abstract: Job-shop scheduling is a typical NP-hard problem which has drawn continuous attention from researchers. In this paper, the Intelligent Water Drops (IWD) algorithm, which is a new meta-heuristics, is customised for solving job-shop scheduling problems. Five schemes are proposed to improve the original IWD algorithm, and the improved algorithm is named the Enhanced IWD algorithm (EIWD) algorithm. The optimisation objective is the makespan of the schedule. Experimental results show that the EIWD algorithm is able to find better solutions for the standard benchmark instances than the existing algorithms. This paper has made a contribution in two aspects. First, to the best of the authors knowledge, this research is the first to apply the IWD algorithm to the job-shop scheduling problem. This work can inspire further studies of applying IWD algorithm to other scheduling problems, such as open-shop scheduling and flow-shop scheduling. Second, this research further improves the original IWD algorithm by employing five schemes to increase the diversity of the solution space as well as the solution quality. © 2012 Copyright Taylor and Francis Group, LLC.
Source Title: International Journal of Production Research
ISSN: 00207543
DOI: 10.1080/00207543.2011.600346
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 18, 2019


checked on Feb 11, 2019

Page view(s)

checked on Jan 26, 2019

Google ScholarTM



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