No / 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.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/9549 |
| Date | January 2012 |
| Creators | Maqsood, Shahid, Noor, S., Khan, M. Khurshid, Wood, Alastair S. |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | No full-text in the repository |
Page generated in 0.0017 seconds