Development of an optimisation model for unequal-area facility layout problems
by Tanveer Hossain Bhuiyan; Sarah Harun; Abdullahil Azeem
International Journal of Industrial and Systems Engineering (IJISE), Vol. 37, No. 1, 2021

Abstract: Optimisation of unequal-area facility layout problems (UA-FLPs) aims to find the optimal arrangement of a given number of non-overlapping departments having unequal area requirements within the facility premises. This paper studies a multi-objective UA-FLP that considers minimising the material transportation cost, maximising the closeness rating score and minimising makespan of the overall facility in developing the layout. We develop a mixed-integer nonlinear programming (MINLP) facility layout model and optimise using a reformulation-based spatial branch-and-bound algorithm. Constraints are developed to ensure non-overlapping of the departments, bounding the departments within the facility, nonlinear expression of required area, and aspect ratio. We reformulate the non-smooth functions of the original model by the smooth ones. The solution of our model provides optimal arrangements as well optimal dimensions of the departments within the facility. Additionally, our model provides a set of Pareto-optimal layouts that enable decision makers in selecting a layout depending on different real-world scenarios.

Online publication date: Tue, 19-Jan-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com