Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
DOI10.1111/J.1475-3995.1996.TB00034.XzbMATH Open0863.90073OpenAlexW4255487269MaRDI QIDQ5690288FDOQ5690288
Authors: Marcello Braglia 
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
Recommendations
simulated annealingheuristicsgenetic algorithmflexible manufacturing systemssingle row machine layout
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Minimizing flow time variance in a single machine system using genetic algorithms
- Simulated annealing for machine layout problems in the presence of zoning constraints
Cited In (7)
- Optimisation of process parameters using meta-heuristics algorithms for the manufacturing of leaf spring assembly
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Single row layout models
- 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
- Title not available (Why is that?)
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)
