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

DOI10.1016/J.COR.2009.04.002MaRDI QIDQ733535zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

simulationmakespanant colony algorithmrandom processing timesgroup shop scheduling problemrandom release dates

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 4086905 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• A fast tabu search algorithm for the group shop scheduling problem
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• 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
• Algorithms for Solving Production-Scheduling Problems
• An ant colony optimization algorithm for shop scheduling problems
• Ant colony optimization theory: a survey
• Ant colony optimization.
• Forecasting policies for scheduling a stochastic due date job shop
• Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
• Mean flow time minimization with given bounds of processing times
• On a routing problem
• On the numerical solutions of stochastic optimization problem
• Optimal makespan scheduling with given bounds of processing times
• Sequencing with uncertain numerical data for makespan minimisation

Cited in

(5)

• Accelerating the calculation of makespan used in scheduling improvement heuristics
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Scheduling algorithms for a semiconductor probing facility
• 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)