Group shops scheduling with makespan criterion subject to random release dates and processing times
DOI10.1016/J.COR.2009.04.002zbMATH Open1171.90389OpenAlexW2091005900MaRDI QIDQ733535FDOQ733535
Authors: Fardin Ahmadizar, M. Ghazanfari, S. M. T. 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
Recommendations
- A contribution to the stochastic flow shop scheduling problem.
- On heuristic solutions for the stochastic flowshop scheduling problem
- scientific article; zbMATH DE number 4099021
- Job Shop scheduling problem with continuous stochastic processing time
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
simulationmakespanant colony algorithmrandom processing timesgroup shop scheduling problemrandom release dates
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Ant colony optimization.
- An ant colony optimization algorithm for shop scheduling problems
- On a routing problem
- Ant colony optimization theory: a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for Solving Production-Scheduling Problems
- Mean flow time minimization with given bounds of processing times
- Optimal makespan scheduling with given bounds of processing times
- Sequencing with uncertain numerical data for makespan minimisation
- A fast tabu search algorithm for the group shop scheduling problem
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
- A hybrid method for solving stochastic job shop scheduling problems
- Forecasting policies for scheduling a stochastic due date job shop
- A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
- Title not available (Why is that?)
- On the numerical solutions of stochastic optimization problem
- Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
Cited In (5)
- 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
- 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
This page was built for publication: Group shops scheduling with makespan criterion subject to random release dates and processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733535)
