Locating repair shops in a stochastic environment

Authors:
J. C. W. van Ommeren;A. F. Bumb;A. V. Sleptchenko
Affiliations:
Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;EURANDOM and Department of Technology and Management, Eindhoven University of Technology, The Netherlands
Venue:
Computers and Operations Research
Year:
2006

Citing 4
Cited 1

Capacitated facility location: separation algorithms and computational experience

Mathematical Programming: Series A and B - Special issue on computational integer programming
Analysis of a local search heuristic for facility location problems

Journal of Algorithms
Local search heuristic for k-median and facility location problems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition

Optimization of a stochastic remanufacturing network with an exchange option

Decision Support Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immediately receives a working item from stock, provided that the stock is not empty. If a stockout occurs, the customer has to wait for a working item. The broken items are repaired in the shop and then put in stock. Sometimes, however, a broken item cannot be fixed at the local repair shop, and it has to be sent to a central repair shop. At the central repair shop the same policy with inventory and repair is used. The problem we focus on, is finding locations for the local repair shops, deciding their capacity, i.e., number of servers and base stock levels, such that the total expected cost is minimized and the fraction of customers that can leave the local shops without waiting is above some specified level. We assume that the central repair shop is already opened, but that the repair capacity still has to be set. The costs we consider are the costs for keeping the repair shops operational, for the transport of items and for the inventory. For this problem, a local search heuristic is proposed and experimental results are presented.