Hybrid Genetic Algorithm (GA) for job shop scheduling problems and its sensitivity analysis Online publication date: Mon, 23-Apr-2012
by Shahid Maqsood; Sahar Noor; M. Khurshid Khan; Alastair Wood
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 11, No. 1/2, 2012
Abstract: The Job Shop Scheduling Problem (JSSP) is a hard combinatorial optimisation problem. This paper presents a heuristic-based Genetic Algorithm (GA) or Hybrid Genetic Algorithm (HGA) with the aim of overcoming the GA deficiency of fine tuning of solution around the optimum, and to achieve optimal or near optimal solutions for benchmark JSSP. The paper also presents a detail GA parameter analysis (also called sensitivity analysis) for a wide range of benchmark problems from JSSP. The findings from the sensitivity analysis or best possible parameter combination are then used in the proposed HGA for optimal or near optimal solutions. The experimental results of the HGA for several benchmark problems are encouraging and show that HGA has achieved optimal solutions for more than 90% of the benchmark problems considered in this paper. The presented results will provide a reference for selection of GA parameters for heuristic-based GAs for JSSP.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook