Abstract

The Double Row Layout Problem (DRLP) is the problem of allocating a given set of machines on both sides of a straight line corridor so as to minimise the total cost of transporting materials among machines. The DRLP occurs in several manufacturing plants, particularly in semiconductor manufacturing. While it has a large practical importance, the problem is very difficult to solve to optimality. In this paper, we construct a mixed-integer programming (MIP) formulation of the problem, which favourably compares to a previously published MIP formulation. The new model is found to present similar performance to another published MIP formulation, and it has the advantage of being more intuitive for handling qualitative inputs that may be required in a layout refinement phase.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call