A hybrid method for solving stochastic job shop scheduling problems
From MaRDI portal
Publication:2572011
DOI10.1016/j.amc.2004.11.036zbMath1091.90026OpenAlexW2008759288MaRDI QIDQ2572011
P. K. Ahmed, Reza Tavakkoli-Moghaddam, F. Vaziri, Amir Azaron, Fariborz Jolai
Publication date: 14 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.11.036
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)
Related Items
Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates, Consultation sequencing of a hospital with multiple service points using genetic programming, A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties, Minimizing makespan for scheduling stochastic job shop with random breakdown, An artificial bee colony algorithm for the job shop scheduling problem with random processing times, Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis, An agent-based parallel approach for the job shop scheduling problem with genetic algorithms, Multi-stage ordinal optimization based approach for job shop scheduling problems, The museum visitor routing problem, Group shops scheduling with makespan criterion subject to random release dates and processing times, A novel parallel quantum genetic algorithm for stochastic job shop scheduling, A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
Cites Work
