ML Anthology

Solving a Stochastic Queueing Design and Control Problem with Constraint Programming

Daria Terekhov, J. Christopher Beck, Kenneth N. Brown
AAAI 2007 pp. 261-266
doi:10.4103/iju.iju_84_20 /aaai/2007/terekhov2007aaai-solving/

Abstract

A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and service times, we seek a smallest-cost combination of cross-trained and specialized workers satisfying constraints on the expected customer waiting time and expected number of workers in the back room. A constraint programming approach using logic-based Benders ’ decomposition is presented. Experimental results demonstrate the strong performance of this approach across a wide variety of problem parameters. This paper provides one of the first links between queueing optimization problems and constraint programming.

PDF AAAI Semantic Scholar

Cite

Text

Terekhov et al. "Solving a Stochastic Queueing Design and Control Problem with Constraint Programming." AAAI Conference on Artificial Intelligence, 2007. doi:10.4103/iju.iju_84_20

Markdown

[Terekhov et al. "Solving a Stochastic Queueing Design and Control Problem with Constraint Programming." AAAI Conference on Artificial Intelligence, 2007.](https://mlanthology.org/aaai/2007/terekhov2007aaai-solving/) doi:10.4103/iju.iju_84_20

BibTeX

@inproceedings{terekhov2007aaai-solving,
  title     = {{Solving a Stochastic Queueing Design and Control Problem with Constraint Programming}},
  author    = {Terekhov, Daria and Beck, J. Christopher and Brown, Kenneth N.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2007},
  pages     = {261-266},
  doi       = {10.4103/iju.iju_84_20},
  url       = {https://mlanthology.org/aaai/2007/terekhov2007aaai-solving/}
}