A new approach for loop machine layout problem integrating proximity constraints

Abstract

This paper focuses on the machine arrangement problem on common loop network in a flexible manufacturing system. Existing studies aim to place machines at pre-fixed positions around a loop network. This problem is considered as a permutation problem that aims to find the best combination to reduce generated costs. In this work, we try to add more complexity to this problem by respecting the proximity constraints, defined by the experts, between the machines. To do this, we propose an algorithm based on direct distance measure. Logically, proximity constraints are checked using direct distances but costs are calculated using travelled distances. Throughout this study, we seek the best machine layout in four transport system configuration types to minimise the sum of flow time distances. Comparing our algorithm results with two hybrid genetic algorithms, the empirical results show that the proposed algorithm provides the most suitable solutions.

Keywords:

• loop network
• layout problem
• direct distance
• proximity constraints
• flexible manufacturing systems

Notes

No potential conflict of interest was reported by the authors.