Staff scheduling at the United States postal service
Computers and Operations Research
The task assignment problem for unrestricted movement between workstation groups
Journal of Scheduling
Evaluating arrival rate uncertainty in call centers
Proceedings of the 38th conference on Winter simulation
Modeling the Regular Constraint with Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Competency and preference based personnel scheduling in large assembly lines
International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
A multi-agent-based approach for personnel scheduling in assembly centers
Engineering Applications of Artificial Intelligence
Monthly tour scheduling models with mixed skills considering weekend off requirements
Computers and Industrial Engineering
Combining metaheuristic algorithms to solve a scheduling problem
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
An agent-based algorithm for personnel shift-scheduling and rescheduling in flexible assembly lines
Journal of Intelligent Manufacturing
| Hi-index | 0.01 |
This paper presents an effective solution strategy for an important category of personnel scheduling problems. Specifically, we address the restricted starting-time tour-scheduling problem (RSTP), which involves the determination of the hours of the day (shifts) and days of the week (days on) that employees are assigned to work. RSTP is characterized by restrictions on the number of daily time periods in which employees may begin their shifts. Moreover, the RSTP we consider contains constraints that require separation of starting times. Such restrictions are widely encountered in practice and are based on a number of factors including managerial concerns for control of employee movements, union contractual obligations, and employee preferences for common shift starting times. A two-stage heuristic solution strategy is proposed for RSTP. We developed eight heuristic procedures based on this strategy and applied them to four sets of labor requirements, for each of 27 United Airlines (UA) airport ground stations. One of the best of these procedures yielded solution costs that averaged only 1.36 full-time-equivalent employees above very conservative LP-based lower bounds. Moreover, the solution costs obtained using this procedure were, on average, 28 percent closer to the lower bounds than solution costs obtained using UA's current scheduling system. We conclude that the two-stage heuristic solution strategy is a valuable platform from which to develop procedures for generating near-optimal solutions to this difficult class of personnel scheduling problems.