Solving a stochastic queueing control problem with constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4510 LNCS, Issue , 2007, Pages 303-317

  Terekhov, Daria ^a   Beck, J Christopher ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONSTRAINED OPTIMIZATION; HEURISTIC METHODS; MATHEMATICAL MODELS; QUEUEING THEORY; RESOURCE ALLOCATION;

CONSTRAINT PROGRAMMING; CUSTOMER DEMAND; WAITING TIME;

PROBLEM SOLVING;

EID: 37149039294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_22     Document Type: Conference Paper

References (16)

1. R. Batta, O. Berman, and Q. Wang. Balancing staffing and switching costs in a call/service center. European Journal of Operations Research. To Appear. Available at: http://www.acsu.buffalo.edu/~batta/papers/Batta_et_al.pdf.
2. O. Berman and R. Larson. A queueing control model for retail services having back room operations and cross-trained workers. Computers and Operations Research, 31(2):201-222, 2004.
3. O. Berman, J. Wang, and K. P. Sapna. Optimal management of cross-trained workers in services with negligible switching costs. European Journal of Operations Research, 167(2):349-369, 2005.
4. Y Caseau and F. Laburthe. Cumulative scheduling with task intervals. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 363-377. MIT Press, 1996.
5. S. Demassey, C Artigues, and P. Michelon. Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS Journal on Computing, 17(1):52-65, 2005.
6. D. Gross and C Harris. Fundamentals of Queueing Theory. John Wiley & Sons, Inc., 1998.
7. B. Hnich, B. Smith, and T. Walsh. Dual modelling of permutation and injection problems. Journal of Artificial Intelligence Research, 21:357-391, 2004.
8. J. D. C. Little. A proof of the queueing formula L = λW. Operations Research, 9:383-387, 1961.
9. P. Martin and D. B. Shmoys. A new approach to computing optimal schedules for the job shop scheduling problem. In Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, pages 389-403, 1996.
10. J. Palmer and I. Mitrani. Optimal server allocation in reconfigurable clusters with multiple job types. In Proceedings of the Computational Science and Its Applications International Conference, pages 76-86, 2004.
11. B.M. Smith. Modelling for constraint programming. Lecture Notes for the First International Summer School on Constraint Programming, 2005. Available at: http://www.mam.unipd.it/~frossi/cp-school/.
12. S.A. Tarim, S. Manandhar, and T. Walsh. Stochastic constraint programming: A scenario-based approach. Constraints, 11(1):53-80, 2006.
13. S.A. Tarim and A. Miguel. A hybrid Benders' decomposition method for solving stochastic constraint programs with linear recourse. In Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, pages 133-148, 2005.
14. D. Terekhov and J. C Beck. Solving a stochastic queueing control problem with constraint programming. Technical Report MIE-OR-TR2006-06, Department of Mechanical and Industrial Engineering, University of Toronto, 2006. Available from http://www.mie.utoronto.ca/labs/ORTechReps/.
15. M.R.C van Dongen. Beyond singleton arc consistency. In Proceedings of the 17th European Conference on Artificial Intelligence, pages 163-167, 2006.
16. T. Walsh. Stochastic constraint programming. In Proceedings of the 15th European Conference on Artificial Intelligence, pages 111-115, 2002.