Group shops scheduling with makespan criterion subject to random release dates and processing times

DOI10.1016/j.cor.2009.04.002zbMath1171.90389MaRDI QIDQ733535

Fardin Ahmadizar, Mehdi Ghazanfari, Seyyed Mohammad Taghi Fatemi Ghomi

Publication date: 16 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.002

zbMATH Keywords

simulation; makespan; random processing times; ant colony algorithm; group shop scheduling problem; random release dates

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Scheduling algorithms for a semiconductor probing facility, Solving a stochastic single machine problem with initial idle time and quadratic objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An ant colony optimization algorithm for shop scheduling problems
• Optimal makespan scheduling with given bounds of processing times
• Mean flow time minimization with given bounds of processing times
• Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• A fast tabu search algorithm for the group shop scheduling problem
• A hybrid method for solving stochastic job shop scheduling problems
• Ant colony optimization theory: a survey
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Sequencing with uncertain numerical data for makespan minimisation
• On a routing problem
• On the numerical solutions of stochastic optimization problem
• Forecasting policies for scheduling a stochastic due date job shop
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• Algorithms for Solving Production-Scheduling Problems