Group shops scheduling with makespan criterion subject to random release dates and processing times
From MaRDI portal
Publication:733535
DOI10.1016/j.cor.2009.04.002zbMath1171.90389OpenAlexW2091005900MaRDI QIDQ733535
Seyyed Mohammad Taghi Fatemi Ghomi, Fardin Ahmadizar, Mehdi Ghazanfari
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
simulationmakespanrandom processing timesant colony algorithmgroup shop scheduling problemrandom release dates
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Scheduling algorithms for a semiconductor probing facility
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