Photo from wikipedia
In the double row layout problem, we wish to position n machines on two parallel rows in order to minimize the cost of material flow among machines. The problem is… Click to show full abstract
In the double row layout problem, we wish to position n machines on two parallel rows in order to minimize the cost of material flow among machines. The problem is NP-hard and has applications in industry. Here, an algorithm is presented, which works in two phases: (1) applying an improvement heuristic to optimize a random double row layout of a certain type and, then, (2) adjusting the absolute position of each machine in the layout via Linear Programming. Four variants of this two-phase algorithm are proposed and their efficiency is demonstrated by computational tests on several instances from the literature with sizes up to 50 machines.
Journal Title: Annals of Operations Research
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!