Combining integer programming and the randomization method to schedule employees

DOI10.1016/j.ejor.2009.04.026zbMath1173.90406OpenAlexW2040530174MaRDI 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 programmingnonstationary queuesemployee schedulingrandomization methodservice operations managementstaffing requirements

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (8)

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

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

This page was built for publication: Combining integer programming and the randomization method to schedule employees