Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
From MaRDI portal
Publication:3055445
DOI10.1080/00207540701644219zbMath1198.90221OpenAlexW2155410572MaRDI QIDQ3055445
No author found.
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701644219
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Makespan minimization on single batch-processing machine via ant colony optimization
Cites Work
- The job shop tardiness problem: A decomposition approach
- Match-up scheduling under a machine breakdown
- Reactive scheduling in a dynamic and stochastic FMS environment
- A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
- Analysis of reactive scheduling problems in a job shop environment