Article thumbnail

Solving a stochastic queueing control problem with constraint programming

By D. Terekhov, J.C. Beck and CPAIOR 2007 Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference

Abstract

In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching workers such that the expected customer waiting time is minimized while the expected back room staffing is sufficient to perform all work. Three novel constraint programming models and a shaving algorithm are presented. Experimental results show that the best constraint programming model, using shaving, is able to find and prove optimal solutions for almost all problem instances within a reasonable run-time, but that an existing heuristic algorithm performs better in terms of solution quality over time. A hybrid method combining the heuristic and the best constraint programming method is shown to perform better than either of these approaches separately. This is the first work of which we are aware that solves a queueing control problem with constraint programming.Anglai

Publisher: 'Springer Science and Business Media LLC'
Year: 2007
DOI identifier: 10.1007/978-3-540-72397-4_22
OAI identifier: oai:dial.uclouvain.be:boreal:67861
Provided by: DIAL UCLouvain
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2078.1/6... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.