Simulated annealing for machine layout problems in the presence of zoning constraints
type: Item
instance of: scholarly article
title: Simulated annealing for machine layout problems in the presence of zoning constraints
zbMATH Open document ID: 0825.90455
DOI: 10.1016/0377-2217(92)90043-9
author: Panagiotis Kouvelis
author: Wen-Chyuan Chiang
author: James Fitzsimmons
published in: European Journal of Operational Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 91845
MaRDI profile type: Publication
full work available at URL: 0377-2217(92)90043-9
OpenAlex ID: W2032506895
cites work: Q3994799
cites work: An exact branch-and-bound procedure for the quadratic-assignment problem
cites work: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
cites work: The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
cites work: Travelling Salesman and Assignment Problems: A Survey
cites work: Time-slot assignment for TDMA-systems
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: Simulated Annealing – An Annotated Bibliography
cites work: A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
cites work: Facility layout design in a changing environment
cites work: Efficient models for the facility layout problem
cites work: Optimization by Simulated Annealing
cites work: Assignment Problems and the Location of Economic Activities
cites work: KBSS: A knowledge-based system for scheduling in automated manufacturing
cites work: The facility layout problem
cites work: The quadratic assignment problem
cites work: Equation of State Calculations by Fast Computing Machines
cites work: A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
cites work: P-Complete Approximation Problems
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: Q3785827
description: scientific article; zbMATH DE number 91845