Linear Arrangements with Closeness Constraints

Abstract

In this thesis we will examine the product location problem on a pick-by-order policy. We restrict the scope of this thesis to a single rack with a front depot and each order can consist of at most two products. We present a polynomial solution for an arbitrary graph where the optimal arrangement of each component is given and present a polynomial solution for forests consisting of trees of, at most, order three.