A Constraint Programming Approach for Solving a Queueing Design and Control Problem

References

• Baptiste P., Laborie P., Le Pape C., Nuijten W., Rossi F., van Beek P., Walsh T. Constraint-based scheduling and planning. Handbook of Constraint Programming (2006) (Elsevier, Amsterdam) 761–799Chapter 22Crossref, Google Scholar
• Batta R., Berman O., Wang Q. Balancing staffing and switching costs in a service center with flexible servers. Eur. J. Oper. Res. (2007) 177(2):924–938Crossref, Google Scholar
• Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4(1):238–252Crossref, Google Scholar
• Berman O., Larson R. C. A queueing control model for retail services having backroom operations and cross-trained workers. Comput. Oper. Res. (2004) 31(2):201–222Crossref, Google Scholar
• Berman O., Sapna-Isotupa K. P. Optimal control of servers in front and back rooms with correlated work. IIE Trans. (2005) 37(2):167–173Crossref, Google Scholar
• Berman O., Wang J., Sapna K. P. Optimal management of cross-trained workers in services with negligible switching costs. Eur. J. Oper. Res. (2005) 167(2):349–369Crossref, Google Scholar
• Brown K. N., Miguel I., Rossi F., van Beek P., Walsh T. Uncertainty and change. Handbook of Constraint Programming (2006) (Elsevier, Amsterdam) 731–760Chapter 21Crossref, Google Scholar
• Brusco M. J. An exact algorithm for a workforce allocation problem with application to an analysis of cross-training policies. IIE Trans. (2008) 40(5):495–508Crossref, Google Scholar
• Cezik M. T., L'Ecuyer P. Staffing multiskill call centers via linear programming and simulation. Management Sci. (2008) 54(2):310–323Link, Google Scholar
• Chevalier P., Tabordon N. Overflow analysis and cross-trained servers. Internat. J. Prod. Econom. (2003) 85(1):47–60Crossref, Google Scholar
• Demassey S., Artigues C., Michelon P. Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS J. Comput. (2005) 17(1):52–65Link, Google Scholar
• Fox M. S. Constraint-directed search: A case study of job-shop scheduling. (1983) . Ph.D. thesis, CMU-RI-TR-85-7, Intelligent Systems Laboratory, The Robotics Institute, Carnegie Mellon University, PittsburghGoogle Scholar
• Gross D., Harris C.Fundamentals of Queueing Theory (1998) (John Wiley & Sons, New York) Google Scholar
• Hooker J. N., Ottosson G. Logic-based Benders' decomposition. Math. Programming (2003) 96(1):33–60Crossref, Google Scholar
• Tadj L., Choudhury G. Optimal design and control of queues. TOP (2005) 13(2):359–412Crossref, Google Scholar
• Tarim S. A., Miguel I., Hnich B., Carlsson M., Fages F., Rossi F. A hybrid Benders' decomposition method for solving stochastic constraint programs with linear recourse. Recent Advances in Constraints: Joint ERCIM/CoLogNET Internat. Workshop on Constraint Solving and Constraint Logic Programming (2005) 3978(Springer, Heidelberg, Germany) 133–148Lecture Notes in Artificial IntelligenceGoogle Scholar
• Terekhov D., Beck J. C. A constraint programming approach for solving a queueing control problem. J. Artificial Intelligence Res. (2008) 32:123–167Crossref, Google Scholar
• Terekhov D., Beck J. C. An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers. Eur. J. Oper. Res. (2009) 198(1):223–231Crossref, Google Scholar
• Terekhov D., Beck J. C., Brown K. N. Solving a stochastic queueing design and control problem with constraint programming. Proc. 22nd Conf. Artificial Intelligence (AAAI'07) (2007) Vancouver(Association for the Advancement of Artificial Intelligence, Menlo Park, CA) 261–266Google Scholar
• van Dongen M. R. C. Beyond singleton arc consistency. Proc. 17th Eur. Conf. Artificial Intelligence (ECAI'06) (2006) Riva del Garda(IOS Press, Amsterdam) 163–167Google Scholar
• Van Hentenryck P., Bent R.Online Stochastic Combinatorial Optimization (2006) (MIT Press, Cambridge, MA) Google Scholar