On the resolution of the single product capacitated machine siting problem
R Cañavate-Bernal,
M Landete-Ruiz and
A Marín-Pérez
Additional contact information
R Cañavate-Bernal: Universidad Miguel Hernández
M Landete-Ruiz: Universidad Miguel Hernández
A Marín-Pérez: Universidad de Murcia
Journal of the Operational Research Society, 2000, vol. 51, issue 8, 982-992
Abstract:
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: location; integer programming; heuristics; Lagrangean relaxation; subgradient optimisation (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600991 Abstract (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:51:y:2000:i:8:d:10.1057_palgrave.jors.2600991
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
DOI: 10.1057/palgrave.jors.2600991
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().