A Tabu-Search Heuristic for the Dynamic Plant Layout Problem

DOI10.1287/ijoc.9.4.374zbMath0901.90150OpenAlexW2109737398MaRDI QIDQ4376739

Joseph B. Mazzola, Bharrat K. Kaku

Publication date: 11 February 1998

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.9.4.374

zbMATH Keywords

tabu-search heuristicdynamic plant layout problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Recent advances in dynamic facility layout research ⋮ The zone-based dynamic facility layout problem ⋮ A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach ⋮ DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES ⋮ A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem ⋮ An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ Simulated annealing heuristics for the dynamic facility layout problem ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem ⋮ A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments ⋮ A tabu search heuristic for the dynamic space allocation problem ⋮ Hybrid ant systems for the dynamic facility layout problem ⋮ An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem