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

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 several shaving procedures for these models are presented. Experimental results show that a model based on closed-form expressions together with a combination of shaving procedures is the most efficient. This model is able to find and prove optimal solutions for many problem instances within a reasonable run-time. Previously, the only available approach was a heuristic algorithm. Furthermore, a hybrid method combining the heuristic and the best constraint programming method is shown to perform as well as the heuristic in terms of solution quality over time, while achieving the same performance in terms of proving optimality as the pure constraint programming model. This is the first work of which we are aware that solves such queueing-based problems with constraint programming.

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

“…Though we can see logic-based Benders' cuts in any form, they must be formularized in the form of linear inequalities because the major problem is an MILP. This method has been used in various combinatorial optimization problems, such as logic circuits' verification by Hooker and Yan [36]; scheduling and planning by Hooker [36,37]; Benini [38]; Bajestani and Beck [39]; deterministic and stochastic location/fleet management by Fazel Zarandi and Beck [17]; Zarandi [31] and finally, control and queue design by Terekhov [40].…”

Logic-Based Benders Decomposition for Large-Scale Optimization

“…In the transportation logistics domain, they include food distribution [110], bicycle sharing [73,74], lock scheduling [123], and supply chain scheduling [115]. Other applications are project scheduling [70], robust call center scheduling [28], task scheduling for satellites [129], course timetabling [19], wind turbine maintenance scheduling [42], queuing design and control [113,114], service restoration planning for infrastructure networks [50], and sports scheduling [23,94,95,120,121].…”

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

“…Logic-based Benders decomposition has been shown to be effective in a wide range of problems including scheduling (Hooker, 2005(Hooker, , 2007Beck, 2010), facility and vehicle allocation (Fazel-Zarandi & Beck, 2012), and queue design and control problems (Terekhov, Beck, & Brown, 2009).…”