Formulation and mathematical programming heuristic for Flexible Layout Design Problem

Abstract

This thesis investigates the Flexible Layout Design Problem (FLDP), which involves a set of stations arranged in a matrix-structured manufacturing system (MMS). Initially, the main objectives are to minimize the number of stations used and to minimize the flow of transport between stations. Subsequently, we implement a Mixed-Integer Linear Programming (MILP) model which integrate resource allocations into the FLDP and propose a matheuristic method to address the problem. We conduct tests using a chosen dataset for 20 minutes and then for 5 minutes. Finally, we discuss the results obtained and conclude with perspectives for future research.