An Adaptive Hyper-Heuristics Genetic Algorithm for Stochastic Job Shop Scheduling Problem

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,An adaptive Hyper-Heuristics genetic algorithms (AHHGA) is proposed combing with characteristics of SJSSP to solve SJSSP with the objective to minimize make span (minimize the expected value of make span). 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.