Combining integer programming and the randomization method to schedule employees
type: Item
instance of: scholarly article
title: Combining integer programming and the randomization method to schedule employees
zbMATH Open document ID: 1173.90406
author: Armann Ingolfsson
author: Fernanda Campello
author: Xudong Wu
author: Edgar Alberto Cabral
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5634749
zbMATH Keywords: service operations management
zbMATH Keywords: employee scheduling
zbMATH Keywords: staffing requirements
zbMATH Keywords: nonstationary queues
zbMATH Keywords: randomization method
zbMATH Keywords: integer programming
describes a project that uses: NLPLIB
describes a project that uses: OPERA
describes a project that uses: TOMLAB
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.04.026
OpenAlex ID: W2040530174
cites work: Call center staffing with simulation and cutting plane methods
cites work: Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
cites work: Optimal Shift Scheduling with Multiple Break Windows
cites work: A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
cites work: Cyclic Scheduling via Integer Programs with Circular Ones
cites work: A simulated annealing approach to the cyclic staff-scheduling problem
cites work: Staffing Multiskill Call Centers via Linear Programming and Simulation
cites work: Staffing of Time-Varying Queues to Achieve Time-Stable Performance
cites work: Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands
cites work: Q3415748
cites work: Accounting for time-varying queueing effects in workforce scheduling
cites work: A survey and experimental comparison of service-level-approximation methods for nonstationary \(M(t)/M/s(t)\) queueing systems with exhaustive discipline
cites work: Server Staffing to Meet Time-Varying Demand
cites work: A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars
cites work: Q4372778
DOI: 10.1016/J.EJOR.2009.04.026
description: scientific article; zbMATH DE number 5634749