Staff scheduling at the United States postal service
Computers and Operations Research
Evaluating arrival rate uncertainty in call centers
Proceedings of the 38th conference on Winter simulation
Competency and preference based personnel scheduling in large assembly lines
International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
A simulation based scheduling model for call centers with uncertain arrival rates
Proceedings of the 40th Conference on Winter Simulation
Selecting the appropriate input data set when configuring a permanent workforce
Computers and Industrial Engineering
Implicit shift scheduling with multiple breaks and work stretch duration restrictions
Journal of Scheduling
Monthly tour scheduling models with mixed skills considering weekend off requirements
Computers and Industrial Engineering
| Hi-index | 0.01 |
This paper presents a compact integer-programming model for large-scale continuous tour scheduling problems that incorporate meal-break window, start-time band, and start-time interval policies. For practical scheduling environments, generalized set-covering formulations (GSCFs) of such problems often contain hundreds of millions of integer decision variables, usually precluding identification of optimal solutions. As an alternative, we present an implicit integer-programming model that frequently has fewer than 1,500 variables and can be formulated and solved using PC-based hardware and software platforms. An empirical study using labor-requirement distributions for customer service representatives at a Motorola, Inc. call center was used to demonstrate the importance of having a model that can evaluate tradeoffs among the various scheduling policies.