Simulated annealing for machine layout problems in the presence of zoning constraints
DOI10.1016/0377-2217(92)90043-9zbMATH Open0825.90455OpenAlexW2032506895MaRDI QIDQ1197690FDOQ1197690
Authors: Panagiotis Kouvelis, Wen-Chyuan Chiang, James Fitzsimmons 
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90043-9
Quadratic programming (90C20) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)
Cites Work
- Optimization by simulated annealing
- Equation of State Calculations by Fast Computing Machines
- Assignment Problems and the Location of Economic Activities
- Title not available (Why is that?)
- P-Complete Approximation Problems
- The facility layout problem
- Tabu Search Applied to the Quadratic Assignment Problem
- Efficient models for the facility layout problem
- The quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Title not available (Why is that?)
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Simulated Annealing – An Annotated Bibliography
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Travelling Salesman and Assignment Problems: A Survey
- Time-slot assignment for TDMA-systems
- Facility layout design in a changing environment
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
Cited In (13)
- A machine-to-loop assignment and layout design methodology for tandem AGV systems with multiple-load vehicles
- Machine layout problem in modern manufacturing facilities
- A practical method for design of hybrid-type production facilities
- An improved tabu search heuristic for solving facility layout design problems
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Optimization and analysis of the profitability of tariff structures with two-part tariffs
- Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
- A part-and-tool assignment method for the workload-balance between machines and the minimisation of tool-shortage occurrences in an FMS
- A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Metaheuristics: A bibliography
- Simulated annealing algorithm for solving the single machine early/tardy problem
This page was built for publication: Simulated annealing for machine layout problems in the presence of zoning constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197690)
