A hybrid method for solving stochastic job shop scheduling problems

DOI10.1016/J.AMC.2004.11.036MaRDI QIDQ2572011zbMATH OpenOpenAlexFDO

Authors R. Tavakkoli-Moghaddam, Fariborz Jolai, F. Vaziri, P. K. Ahmed, Amir Azaron

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

zbMATH Keywords

Neural networksSimulated annealingStochastic job shop scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Stochastic scheduling theory in operations research (90B36)

Recommendations

• A hybrid genetic algorithm for stochastic job-shop scheduling problems
• An effective hybrid optimization strategy for job-shop scheduling problems
• Hybrid estimation of distribution algorithm for stochastic job shop scheduling with earliness/tardiness penalty
• Hybrid rollout approaches for the job shop scheduling problem
• An hybrid estimation of distribution algorithm for solving flexible job-shop scheduling problem
• Job Shop scheduling problem with continuous stochastic processing time
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Job-shop scheduling using neural networks
• Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
• Two simulated annealing-based heuristics for the job shop scheduling problem

Cited in

(20)

• An artificial bee colony algorithm for the job shop scheduling problem with random processing times
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
• Job Shop scheduling problem with continuous stochastic processing time
• Multi-stage ordinal optimization based approach for job shop scheduling problems
• Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques
• Minimizing makespan for scheduling stochastic job shop with random breakdown
• A supervised method for scheduling multi-objective job shop systems in the presence of market uncertainties
• Group shops scheduling with makespan criterion subject to random release dates and processing times
• The museum visitor routing problem
• Metamodel-guided Lévy optimization for stochastic hybrid shop scheduling with semi-finished product and due date constraints
• Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• A novel job search problem in hybrid uncertain environment
• A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Exact and matheuristic algorithms for robust lot-sizing and scheduling problems with uncertain capacity
• A novel parallel quantum genetic algorithm for stochastic job shop scheduling
• Consultation sequencing of a hospital with multiple service points using genetic programming
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling

This page was built for publication: A hybrid method for solving stochastic job shop scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572011)