Abstract

We consider a new facility layout problem. The Directed Circular Facility Layout Problem (DCFLP) seeks to optimally arrange machines on a circular layout with given material flow direction. The DCFLP allows for a wide range of applications and contains several other relevant layout problems as special cases. We model the DCFLP as a Linear Ordering Problem and solve it using an Integer Linear Program and a Tabu Search heuristic. In our computational study we show that the DCFLP is easier to solve for both exact and heuristic approaches than other related layout problems.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.