On the optimality of the sequential approach for network design problems of service operations. (25th November 2018)

• Record Type: Journal Article
• Authors: Baron, Opher; Berman, Oded; Deutsch, Yael
• Is Part Of: Naval research logistics. Volume 65:Number 5(2018)
• Page Start: 363
• Page End: 377
• Publication Date: 2018-11-25
• Subjects: congestion -- finite buffer -- optimization -- service network design; Logistics, Naval -- Periodicals; Supplies and stores -- Periodicals; 359.07
• DOI: 10.1002/nav.21812
• Languages: English
• ISSNs: 0894-069X

Abstract

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.