Article ID: | iaor20013947 |
Country: | Netherlands |
Volume: | 128 |
Issue: | 3 |
Start Page Number: | 625 |
End Page Number: | 638 |
Publication Date: | Feb 2001 |
Journal: | European Journal of Operational Research |
Authors: | Amiri Ali |
Keywords: | heuristics, programming: mathematical |
This paper studies the multi-hour service system design problem that involves locating service facilities, determining their number and capacities and assigning user nodes to those facilities under time varying demand conditions. The goal is to minimize total costs made of the costs of accessing facilities by users and waiting for service at these facilities as well as the cost of setting up and operating the facilities. A unified model is proposed for the problem to exploit the benefits of the non-coincidence of demand across busy-hours. Two Lagrangean relaxation-based heuristic solution procedures are developed and the results of extensive computational experiments are reported.