𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two new heuristic algorithms for the maximal planar layout problem

✍ Scribed by Jürgen Merker; Gerhard Wäscher

Book ID
105235813
Publisher
Springer
Year
1997
Tongue
German
Weight
712 KB
Volume
19
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Task Assignment Problem: Two New
On the Task Assignment Problem: Two New Efficient Heuristic Algorithms
✍ Y. Kopidakis; M. Lamari; V. Zissimopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 156 KB

We study the problem of task allocation in heterogeneous distributed systems. The objective is the minimization of the sum of processor execution and intertask communication costs. We transform the problem to a maximization one, where we try to determine and avoid large communication costs and ineff

Genetic algorithm using a modified backw
Genetic algorithm using a modified backward pass heuristic for the dynamic facility layout problem
✍ Kazi Shah Nawaz Ripon; Kyrre Glette; Dirk Koch; Mats Hovin; Jim Torresen 📂 Article 📅 2011 🏛 SP Versita 🌐 English ⚖ 309 KB

## Abstract Layout planning in a manufacturing company is an important economical consideration. In the past, research examining the facility layout problem (FLP) generally concerned static cases, where the material flows between facilities in the layout have been assumed to be invariant over time.