Backtracking of jobs in one-dimensional machine location problems
From MaRDI portal
Publication:1127161
DOI10.1016/0377-2217(94)00008-ZzbMath0912.90181OpenAlexW1987170335MaRDI QIDQ1127161
Gary L. Hogg, Bhaba R. Sarker, Wilbert E. Wilhelm, Min-Hong Han
Publication date: 25 May 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00008-z
quadratic assignmentdepth-first insertion heuristicmachine locationmeasure of backtrackingmulti-pass heuristic
Related Items
Flow distance reduction for a multi-product flowline with sets of identical machines ⋮ Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem ⋮ A survey for the quadratic assignment problem ⋮ Machine layout problem in modern manufacturing facilities ⋮ The effect of material flow and workload on the performance of machine location heuristics. ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic procedure for solving the quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Recursion Models for Describing and Managing the Transient Flow of Materials in Generalized Flowlines
- DISCON: A New Method for the Layout Problem
- On the One-Dimensional Space Allocation Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Numerical investigations on quadratic assignment problems
- Backtracking and its Amoebic Properties in One-dimensional Machine Location Problems