The convergence of stochastic algorithms solving flow shop scheduling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 1261810 (Why is no real title available?)
- scientific article; zbMATH DE number 1301968 (Why is no real title available?)
- scientific article; zbMATH DE number 1016640 (Why is no real title available?)
- scientific article; zbMATH DE number 1082099 (Why is no real title available?)
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments
- On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects
- Ordonnancements à contraintes disjonctives
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Short Shop Schedules
- Stochastic simulations of two-dimensional composite packings
- The Complexity of Flowshop and Jobshop Scheduling
- The flow shop with parallel machines: A tabu search approach
- Two simulated annealing-based heuristics for the job shop scheduling problem
Cited in
(3)
This page was built for publication: The convergence of stochastic algorithms solving flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608340)