A stochastic optimization method for solving the machine---part cell formation problem

  • Authors:
  • Khoa Trinh;Jacques Ferland;Tien Dinh

  • Affiliations:
  • Faculty of Information Technology, University of Science, VNU-HCMC, Ho Chi Minh City, Vietnam;Interuniversity Research Center on Enterprise Networks, Logistics and Transportation, Université de Montréal, Montréal, Québec, Canada;Faculty of Information Technology, University of Science, VNU-HCMC, Ho Chi Minh City, Vietnam

  • Venue:
  • ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the machine---part cell formation problem. The problem is to assign the given machines and parts into cells so that the grouping efficacy, a measure of autonomy, is maximized. First, we introduce a new randomized local search algorithm which requires solving another subproblem for assigning optimally parts into cells on the basis of given groups of machines. Second, we propose an exact, polynomial---time algorithm to solve this subproblem. Finally, we provide the numerical results of our proposed algorithm, using a popular set of benchmark problems. Comparisons with other recent algorithms in the literature show that our algorithm can improve the current best-known solutions for some instances.