{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:01:26Z","timestamp":1759939286421},"reference-count":23,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0305-0548(94)90104-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"557-572","source":"Crossref","is-referenced-by-count":19,"title":["The capacity expansion problem in the service industry"],"prefix":"10.1016","volume":"21","author":[{"given":"Oded","family":"Herman","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Ganz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90104-X_BIB1","series-title":"Managing Innovation\u2014Cases From the Services Industries","year":"1988"},{"key":"10.1016\/0305-0548(94)90104-X_BIB2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02591729","article-title":"An o(n) algorithm for the multiple-choice knapsack linear problem","volume":"29","author":"Dyer","year":"1984","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90104-X_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0377-2217(81)90199-5","article-title":"A comparative study of approaches to dynamic location problems","volume":"6","author":"Erlenkotter","year":"1981","journal-title":"Eur. J. opl Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB4","series-title":"Investments for Capacity Expansion: Size, Location, and Time-Phasing","year":"1967"},{"key":"10.1016\/0305-0548(94)90104-X_BIB5","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.30.5.907","article-title":"Operations research and capacity expansion problems: a survey","volume":"30","author":"Luss","year":"1982","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB6","series-title":"Capacity Expansion, Analysis of Simple Models with Applications","author":"Freidenfelds","year":"1981"},{"key":"10.1016\/0305-0548(94)90104-X_BIB7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/opre.35.2.249","article-title":"Multifacility-type capacity expansion planning: algorithms and complexities","volume":"35","author":"Sang-Bum","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB8","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/mnsc.23.9.946","article-title":"Planning electric power generation: a nonlinear mixed integer model employing benders decomposition","volume":"23","author":"Noonan","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB9","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1287\/mnsc.32.9.1140","article-title":"The multiregion dynamic capacity expansion problem: an improved heuristic","volume":"32","author":"Fong","year":"1986","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB10","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1287\/opre.29.4.787","article-title":"The multiregion dynamic capacity expansion problem","volume":"29","author":"Fong","year":"1981","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB11","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1287\/opre.29.4.800","article-title":"The multiregion dynamic capacity expansion problem","volume":"29","author":"Fong","year":"1981","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0038-0121(92)90022-W","article-title":"The capacity expansion problem in the service industry with multiple resource constraints","volume":"26","author":"Ganz","year":"1992","journal-title":"Socio-Econ. Plan. Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB13","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0305-0548(94)90104-X_BIB14","series-title":"Fundamentals of Network Analysis","author":"Phillips","year":"1981"},{"key":"10.1016\/0305-0548(94)90104-X_BIB15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/mnsc.20.1.56","article-title":"Capacity expansion and specialization","volume":"20","author":"Kalotay","year":"1973","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB16","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1287\/mnsc.22.3.274","article-title":"Capacity planning for large multi-location systems: approximate and incomplete dynamic programming approach","volume":"22","author":"Erlenkotter","year":"1975","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","article-title":"Exact methods for the knapsack problem and its generalizations","volume":"28","author":"Dudzi\u0144ski","year":"1987","journal-title":"Eur. J. opl Res."},{"key":"10.1016\/0305-0548(94)90104-X_BIB18","article-title":"Capacity planning the service industry","author":"Ganz","year":"1991"},{"key":"10.1016\/0305-0548(94)90104-X_BIB19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/362875.362901","article-title":"Algorithm 347: an efficient algorithm for sorting with minimal storage","volume":"12","author":"Singleton","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(94)90104-X_BIB20","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","article-title":"The design of the XMP linear programming library","volume":"7","author":"E. Marsten","year":"1981","journal-title":"ACM Trans, mathl Softw."},{"key":"10.1016\/0305-0548(94)90104-X_BIB21","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.23.6.631","article-title":"A flow augmentation approach to the network with gains minimum cost flow problem","volume":"23","author":"Jensen","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90104-X_BIB22","author":"Marsten","year":"1988"},{"key":"10.1016\/0305-0548(94)90104-X_BIB23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1287\/mnsc.26.1.86","article-title":"Pivot and complement\u2014a heuristic for 0\u20131 programming","volume":"26","author":"Balas","year":"1980","journal-title":"Mgmt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489490104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489490104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:26:50Z","timestamp":1552930010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489490104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["030505489490104X"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90104-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}