Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
From MaRDI portal
Publication:5690288
Recommendations
Cites work
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Minimizing flow time variance in a single machine system using genetic algorithms
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Simulated annealing for machine layout problems in the presence of zoning constraints
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
Cited in
(7)- Optimisation of process parameters using meta-heuristics algorithms for the manufacturing of leaf spring assembly
- Single row layout models
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Sequence optimization and design of allocation using GA and SA
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient tabu algorithm for the single row facility layout problem
- scientific article; zbMATH DE number 2068261 (Why is no real title available?)
This page was built for publication: Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690288)