 On the optimality of the sequential approach for network design problems of service operationsOpher Baron, Oded Berman and Yael Deutsch Naval Research Logistics (NRL), 2018, vol. 65, issue 5, 363-377 Abstract: We consider the problem of service network design: choosing the optimal number, locations, and service capacities of facilities, taking into account that facilities may have a finite or an infinite waiting room. Accordingly, our service measure is either the percentage of blocked customers or the percentage of customers who need to wait in line. The goal is to minimize the total cost, which consists of costs associated with traveling, blocking or queueing delay, service capacities, and operating (fixed) costs. We derive structural results when facilities are on a two‐node network, and then use them to study the problem for a general network. We prove that the cost of service capacity and the cost of blocking or queueing delay are independent of the number of opened facilities as long as all facilities are identical in terms of their design parameters c and K (or only c in the case of an infinite waiting room). We use our results to develop an efficient algorithm that solves the problem for general networks. Finally, to demonstrate the applicability of our results and tractability of our algorithm, we discuss as an example an industrial‐size problem, which considers the drive‐through operations of McDonald's in the Toronto metropolitan area. Date: 2018 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:65:y:2018:i:5:p:363-377 Access Statistics for this article More articles in Naval Research Logistics (NRL) from John Wiley & Sons |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.