The convergence of stochastic algorithms solving flow shop scheduling
From MaRDI portal
Publication:1608340
DOI10.1016/S0304-3975(01)00293-6zbMath1016.68178OpenAlexW2019687552MaRDI QIDQ1608340
C. K. Wong, K. Steinhöfel, Andreas A. Albrecht
Publication date: 5 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00293-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Stochastic simulations of two-dimensional composite packings
- The flow shop with parallel machines: A tabu search approach
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- The Complexity of Flowshop and Jobshop Scheduling
- Ordonnancements à contraintes disjonctives
- Short Shop Schedules
- On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects
