首页 | 本学科首页   官方微博 | 高级检索  
     


Staff Scheduling with Day-Off and Workstretch Constraints
Authors:Kenneth R. Baker   Richard N. Burns  Michael Carter
Affiliation: a Graduate School of Business Administration, Duke University, Durham, NCb Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
Abstract:A day-off scheduling problem is analyzed, in which the objective is to minimize the total workforce size necessary to meet a given daily requirement for staff and subject to constraints involving frequency of weekends off and length of work tours. By exploring special structure in the problem, we deduce a flexible, modular technique for building optimal schedules.
Keywords:
本文献已被 InformaWorld 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号