On the resolution of the single product capacitated machine siting problem |
| |
Authors: | R Cañavate-Bernal M Landete-Ruiz A Marín-Pérez |
| |
Institution: | 1.Universidad Miguel Hernández,Spain;2.Universidad de Murcia,Spain |
| |
Abstract: | The single product capacitated machine siting problem (SPCMSP) is an extension of the simple plant location problem, in which plant production depends on installing capacitated machines. In this paper we compare, both theoretically and computationally, three heuristic algorithms for the SPCMSP based upon Lagrangean relaxation and reduction tests of a mixed-integer formulation of the problem, which is NP-hard. We test the performance of the algorithms with examples involving up to 100 potential plants, 1000 customers and six potential machines per plant, which we obtain encouraging results. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|