Job Shop- Evolutionary algorithm for stochastic job shop Author & Year Zandieh & Adibi, 2010

Renna,2010 Zhou, Nee & Lee, 2009 dynamic JSSP Problem Dynamic JSSP: random job arrivals and machine breakdowns Methodology VNS: variable neighborhood search Pheromone-based approach and carried out by multy-agent architecture ACO:Ant colony optimization algorithm with 3 levels machine utilizations, 3 different processing time distributions, 3 different performance measures Hybrid method: neural network approach to generate initial feasible solution & SA(simulation annealing) algorithm to improve the quality and performance of initial solutionsto obtain a nearoptimal solution Efficient decomposition integration genetic algorithm Competitive co-evolutionary quantum genetic algorithm (GA) Integrated simulation into genetic algorithm

TavakkoliMoghaddam, Jolai, Vaziri, Ahmed & Azaron, 2005

Lei, 2010 Gu, Gu, Cao & Gu, 2010 Gholami & Zandieh, 2009

Minimize the maximum fuzzy completion time SJSSP with the objective to minimize the expected makespan Dynamic scheduling of a flexible job shop with the objectiveto minimize the expected makespan and expected mean tardiness SJSSP with the objective of minimizing the expected makespan, where the processing times are s.t. independent normal distribution SJSSP,minimize expected sum of storage expenses(earliness cost) and tardiness penalties

Gu, Gu & Gu, 2009

Parallel quantum genetic algorithm

Horng, Lin & Yang, 2012

ESOO: evolutionary strategy in ordinal optimization to solve for a good enough feasible schedule within a reasonable amount of time

scheduling with random processing time

Flow Shop- Heuristic solution methods for the stochastic flow shop problem Author & Year Problem Methodology Talwars Rule,1967 2 machine, exponancial By sequencing jobs ini dist., minimize makespan nonincreasing order of () Talwars Rule! Kalczynski & 2 machine, Weibull Adapted Talwarss result Kamburowski, 2006 distribution Baker & Trietsch, 2010 Compare 3 heuristic 1. Johnsons heuristic procedure for 2 machine 2. Talwars heuristic stochastic model, general 3. Adjacent Pairwise probability dist. Interchange heuristic the same good performance can be achieve in m-machine case. m-machine, expected Descrive above 3 main makespan objective heuristic procedures: 1,2 follow the logic of CDS algor. Create a seris of 2machine pseudo-problems 3 NEH algorithm, applied directly to stochastic problem. Find the best two job sequence, then make sure the third job inserts in the best place of the two-job-squence, and the forth job inserts..

Kenneth R. Baker, Dominik Altheimer, 2012

Group Shop- Group shops scheduling with makespan criterion Author & Year Singer Problem Job shop with random processing times and individual due dates, total weighted tardiness minimized JSSP with random processing time,minimizing average value of total cost JSSP with random processing time, minimize the expected makespan Methodology heuristic

reference[3-5] Yoshitomi Yamaguchi TavakkoliMoghaddam (same as page 1) [9-11]

Heuristic decision-making rule Simulation-based genetic algorithm Enhanced above genetic algorithm by applying new crossover operator Hybrid method: neural network & simulated annealing algorithm Exact and heuristic algorithm

JSSP with random operations, minimize idle cost or . JSSP, random processing time any real value b.t. known lower and upper bounds. Which can take , makespan or mean flow time min. JSSP, uncertain arrival time, processing time, due date and part priorities, minimize expected job tardiness and earliness cost JSSP, stochastic precedence constraints, minimize expected makespan Open shop scheduling problem, random processing time, breakdowns and repair times, minimize expected makespan Stochastic group shop scheduling (SGSS) problem. Stochastically distribution release dates and procesing times(known dist.), minimize the expected completion time or makespan

Luh

Combine Lagrangian relaxation and stochastic dynamic programming Heuristics base on aggregate schedules General dynamic procedure that converts any problem into a set of scheduling problems without breakdowns Combination of ant colony optimization (ACO) algorithm and heuristic algorithm

Neumann and Schneider Alcaide

Fardin Ahmadizar, Mehdi Ghazanfari, 2010

subject to random release dates and processing times