Simple Approaches to Shift, Days-Off and Tour Scheduling Problems
Shift and days-off scheduling problems have received much attention in the literature of integer programming approaches to workforce scheduling. A typical managerial use would be to schedule full-time employees to minimize the number of labor hours while satisfying variable workforce requirements of a service delivery system. We present computational experience to show that an easily implemented application of linear programming frequently produces optimal solutions to these problems. When the context progresses toward a continuous operating environment (service delivery over 24 hours a day, 7 days a week) we stress the need to shed the myopic views of the shift and days-off scheduling formulations in favor of an integrative tour scheduling formulation. For this problem we observe that a simple heuristic initiated by rounding down the associated LP solution consistently produces near optimal solutions. This observation is based on experiments over varying workforce requirement patterns.
Volume (Year): 29 (1983)
Issue (Month): 8 (August)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:29:y:1983:i:8:p:942-950. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.