Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
From MaRDI portal
Publication:5690288
DOI10.1111/j.1475-3995.1996.tb00034.xzbMath0863.90073MaRDI QIDQ5690288
Publication date: 10 June 1997
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1996.tb00034.x
heuristics; flexible manufacturing systems; simulated annealing; genetic algorithm; single row machine layout
68T05: Learning and adaptive systems in artificial intelligence
90B30: Production models
90C27: Combinatorial optimization
Related Items
An ant algorithm for the single row layout problem in flexible manufacturing systems, An efficient tabu algorithm for the single row facility layout problem
Cites Work
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Minimizing flow time variance in a single machine system using genetic algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item