Open Access Open Access  Restricted Access Subscription or Fee Access

An Adaptive Hyper-Heuristics genetic algorithm for stochastic job shop scheduling problem

Xiu-qing Liu, Xiao-yuan Wang


Stochastic job - shop scheduling problem (SJSSP) is a kind of stochastic programming problem which transformed from job - shop scheduling problem (JSSP). The current methods to solve SJSSP ignored characteristics of SJSSP, which lead to large solution times and inefficient solution. Aiming at the problem, Adaptive Hyper-Heuristics genetic algorithms (AHHGA) is proposed combing with characteristics of SJSSP to solve SJSSP with the objective to minimize the expected value of makespan. Four heuristics rules for SJSSP were designed. Portfolios of processing times of job can be seen as a scenario. The outer loop of the proposed algorithms is to determine heuristics rules on each scenario in scenario set. The inner loop is that a genetic algorithm is employed on the high level and Heuristics rules on each scenario in scenario set are used for constructing scheduling timetables are work on the low level within the hyper-heuristic framework. Thus, the proposed algorithm ensures to find a better solution in a limit search scope with respect to characteristics of SJSSP. FT benchmark-based problems where the processing times are subjected to independent normal distributions are solved effectively by AHHGA. The experiment results achieved by AHHGA are compared with quantum-inspired genetic algorithm (QGA) and standard genetic algorithm (GA) and a novel competitive co-evolutionary quantum genetic algorithm (CCQGA),which shows that AHHGA has better feasibility and effectiveness.


job-shop scheduling; genetic algorithm; production management; production control.

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.