New Mixed Integer Programming for Facility Layout Design without Loss of Department Area

Abstract

This paper proposes a New Mixed Integer Programming (NMIP) for solving facility layout problem (FLP). The formulation is extensively tested on problems from literature to minimize material handling cost when addresses on the shop floor. Every department and shop floor in tested problem were fixed dimension of length and width. Classic Mixed Integer Programming (MIP) solves FLP with fixed layout area and preset each department’s lower-upper limit of length and width. As a result, there might be some departments with 5-10% area less than initial layout design requirements which leads to problem in design and construction process. It is infeasible to address the department on the actual shop floor thus adjustment of result from MIP is required. The main purpose of NMIP is to eliminate such infeasibility and show the efficiency of this model.

Keywords: mixed integer programing, facility layout design, facility layout problem, heuristics