A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling

DOI10.1111/1475-3995.00429zbMath1108.90317OpenAlexW1981490227MaRDI QIDQ4814097

No author found.

Publication date: 7 September 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00429

Mathematics Subject Classification ID

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

Related Items

A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ An artificial bee colony algorithm for the job shop scheduling problem with random processing times ⋮ A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty ⋮ Statistical arbitrage: factor investing approach ⋮ Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Group shops scheduling with makespan criterion subject to random release dates and processing times ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Comparative analysis of operation strategies in schedule design for a fixed bus route

Cites Work

• A genetic algorithm for the job shop problem
• Evolution based learning in a job shop scheduling environment
• Deterministic job-shop scheduling: Past, present and future
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems