...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >Efficient generation of rotating workforce schedules
【24h】

Efficient generation of rotating workforce schedules

机译：高效生成轮换员工时间表

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Generating high-quality schedules for a rotating workforce is a critical task in all situations where a certain staffing level must be guaranteed, such as in industrial plants or police departments. Results from ergonomics (BEST, Guidelines for shiftworkers, Bulletin of European Time Studies No. 3, European Foundation for the Improvement of Living and Working Conditions, 1991) indicate that rotating workforce schedules have a profound impact on the health and satisfaction of employees as well as on their performance at work. Moreover, rotating workforce schedules must satisfy legal requirements and should also meet the objectives of the employing organization. In this paper, our description of a solution to this problem is being stated. One of the basic design decisions was to aim at high-quality schedules for realistically sized problems obtained rather quickly, while maintaining human control. The interaction between the decision-maker and the algorithm therefore consists of four steps: (1) choosing a set of lengths of work blocks (a work block is a sequence of consecutive days of work), (2) choosing a particular sequence of blocks of work and days-off blocks amongst these that have optimal weekend characteristics, (3) enumerating possible shift sequences for the chosen work blocks subject to shift change constraints and bounds on sequences of shifts, and (4) assignment of shift sequences to work blocks while fulfilling the staffing requirements. The combination of constraint satisfaction and problem-oriented intelligent backtracking algorithms in each of the four steps allows for finding good solutions for real-world problems in acceptable time. Computational results from a benchmark example found in the literature confirmed the viability of our approach. The algorithms have been implemented in commercial shift scheduling software.
机译：在必须保证一定人员配备水平的所有情况下（例如在工厂或警察部门中），为轮换员工制定高质量的日程安排是一项关键任务。人体工程学的结果（BEST，轮班工人指南，欧洲时间研究公报第3期，欧洲改善生活和工作条件基金会，1991年）表明，轮换工作时间表也对员工的健康和满意度产生深远影响就像他们在工作中的表现一样。此外，轮换工作人员时间表必须满足法律要求，并且还应满足用人组织的目标。在本文中，我们描述了此问题的解决方案。基本的设计决策之一是针对高质量的进度表，以解决相当快地解决的实际问题，同时保持人为控制。因此，决策者与算法之间的交互包括四个步骤：（1）选择一组工作块的长度（一个工作块是一系列连续的工作日），（2）选择一个特定的块序列其中具有最佳周末特征的工作和休息日;（3）列举受制于班次变更约束和班次界限的所选工作块的可能班次，以及（4）将班次分配给工作班同时满足人员需求。在这四个步骤的每一个步骤中，都将约束满足与面向问题的智能回溯算法相结合，可以在可接受的时间内找到针对实际问题的良好解决方案。从文献中找到的基准示例的计算结果证实了我们方法的可行性。该算法已在商业轮班调度软件中实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号