Combining integer programming and the randomization method to schedule employees

DOI10.1016/j.ejor.2009.04.026zbMath1173.90406MaRDI QIDQ1038393

Xudong Wu, Fernanda Campello, Armann Ingolfsson, Edgar Alberto Cabral

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.026

zbMATH Keywords

integer programming; nonstationary queues; employee scheduling; randomization method; service operations management; staffing requirements

Mathematics Subject Classification ID

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

90B22: Queues and service in operations research

Related Items

Physician Staffing for Emergency Departments with Time-Varying Demand, A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand, The first international nurse rostering competition 2010, Optimizing daily agent scheduling in a multiskill call center, Setting staffing requirements for time dependent queueing networks: the case of accident and emergency departments, Joint chance-constrained staffing optimization in multi-skill call centers, Profit-oriented shift scheduling of inbound contact centers with skills-based routing, impatient customers, and retrials, Contact Center Scheduling with Strict Resource Requirements

Uses Software

• NLPLIB
• OPERA
• TOMLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Accounting for time-varying queueing effects in workforce scheduling
• Call center staffing with simulation and cutting plane methods
• A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary M(t)/M/s(t) Queueing Systems with Exhaustive Discipline
• Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
• Staffing Multiskill Call Centers via Linear Programming and Simulation
• Staffing of Time-Varying Queues to Achieve Time-Stable Performance
• A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
• Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands
• Cyclic Scheduling via Integer Programs with Circular Ones
• A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars
• Server Staffing to Meet Time-Varying Demand
• Optimal Shift Scheduling with Multiple Break Windows
• A simulated annealing approach to the cyclic staff-scheduling problem