A constraint programming approach for solving a queueing control problem

Journal of Artificial Intelligence Research

Volumn 32, Issue , 2008, Pages 123-167

  Terekhov, Daria ^a   Beck, J Christopher ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; SALES; STOCHASTIC SYSTEMS;

CLOSED-FORM EXPRESSION; CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING MODEL; CUSTOMER ARRIVALS; FRONT ROOM AND BACK ROOM OPERATIONS; OPTIMAL SOLUTIONS; PROBLEM INSTANCES; QUEUEING CONTROL;

HEURISTIC METHODS;

EID: 52249115406     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2446     Document Type: Article

References (28)

1. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based Scheduling. Kluwer Academic Publishers.
2. Batta, R., Berman, O., & Wang, Q. (2007). Balancing staffing and switching costs in a service center with flexible servers. European Journal of Operational Research, 177, 924-938.
3. Beck, J. C., & Prestwich, S. (2004). Exploiting dominance in three symmetric problems. In Fourth International Workshop on Symmetry and Constraint Satisfaction Problems.
4. Beck, J. C., & Wilson, N. (2007). Proactive algorithms for job shop schedulng with probabilistic durations. Journal of Artificial Intelligence Research, 28, 183-232.
5. Berman, O., & Larson, R. (2004). A queueing control model for retail services having back room operations and cross-trained workers. Computers and Operations Research, 31(2), 201-222.
6. Berman, O., Wang, J., & Sapna, K. P. (2005). Optimal management of cross-trained workers in services with negligible switching costs. European Journal of Operational Research, 167(2), 349-369.
7. Brown, K. N., & Miguel, I. (2006). Uncertainty and change. In Rossi, F., van Beek, P., & Walsh, T. (Eds.), Handbook of Constraint Programming, chap. 21, pp. 731-760. Elsevier.
8. Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 363-377. MIT Press.
9. Cezik, M. T., & L'Ecuyer, P. (2008). Staffing multiskill call centers via linear programming and simulation. Management Science, 54(2), 310-323.
10. Demassey, S., Artigues, C., & Michelon, P. (2005). Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS Journal on Computing, 17(1), 52-65.
11. Fox, M. S. (1983). Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Ph.D. thesis, Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA. CMU-RI-TR-85-7.
12. Gross, D., & Harris, C. (1998). Fundamentals of Queueing Theory. John Wiley & Sons, Inc.
13. Hnich, B., Smith, B. M., & Walsh, T. (2004). Dual modelling of permutation and injection problems. Journal of Artificial Intelligence Research, 21, 357-391.
14. Martin, P., & Shmoys, D. B. (1996). A new approach to computing optimal schedules for the job shop scheduling problem. In Proceedings of the Fiflh Conference on Integer Programming and Combinatorial Optimization, pp. 389-403.
15. Palmer, J., & Mitrani, I. (2004). Optimal server allocation in reconfigurable clusters with multiple job types. In Proceedings of the International Conference on Computational Science and Its Applications (ICCSA '04), pp. 76-86.
16. Policella, N., Smith, S. F., Cesta, A., & Oddi, A. (2004). Generating robust schedules through temporal flexibility. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS'04), pp. 209-218.
17. Simon, H. A. (1997). Models of Bounded Rationality, Vol. 3. MIT Press.
18. Smith, B. M. (2005). Modelling for constraint programming. Lecture Notes for the First International Summer School on Constraint Programming. Available at: http://www.math.unipd.it/~frossi/cp-school/.
19. Smith, B. M. (2006). Modelling. In Rossi, F., van Beek, P., & Walsh, T. (Eds.), Handbook of Constraint Programming, chap. 11, pp. 377-406. Elsevier.
20. Solver (2006). ILOG Scheduler 6.2 User's Manual and Reference Manual. ILOG, S.A.
21. Sutton, A. M., Howe, A. E., & Whitley, L. D. (2007). Using adaptive priority weighting to direct search in probabilistic scheduling. In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, pp. 320-327.
22. Tadj, L., & Choudhury, G. (2005). Optimal design and control of queues. TOP, 13(2), 359-412.
23. Tarim, S. A., Manandhar, S., & Walsh, T. (2006). Stochastic constraint programming: A scenario-based approach. Constraints, 11(1), 53-80.
24. Tarim, S. A., & Miguel, I. (2005). 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, pp. 133-148.
25. Terekhov, D. (2007). Solving queueing design and control problems with constraint programming. Master's thesis, Department of Mechanical and Industrial Engineering, University of Toronto.
26. Terekhov, D., & Beck, J. C. (2007). Solving a stochastic queueing control problem with constraint programming. In Proceedings of the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), pp. 303-317. Springer-Verlag.
27. van Dongen, M. R. C. (2006). Beyond singleton arc consistency. In Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), pp. 163-167.
28. Walsh, T. (2002). Stochastic constraint programming. In Proceedings of the Fifteenth European Conference on Artificial Intelligence, pp. 111-115.