论文标题
计算机辅助的N-SHIFT RWS
Computer-Aided Generation of N-shift RWS
论文作者
论文摘要
对于许多雇主来说，为班次工人生成时间表至关重要，无论雇主是小型或大型工业综合体，研究实验室还是其他涉及轮班工作的企业。 创建旋转劳动力时间表的先前方法包括计划制造商和算法之间的交互，包括定义连续工作天数的序列。 在此方法中，算法从计划制造商中考虑输入（或约束），然后在第一阶段提出可能的解决方案（包括所有偏移，每周工作时间，每周工作时间，最小的休息时间等）。然后，计划制造商可以在第二阶段中选择最可行的解决方案，然后在其中构建和导出最终的时间表。
Generating schedules for shift workers is essential for many employers, whether the employer is a small or a large industrial complex, research laboratory, or other businesses involving shift works. Previous methods for creating rotational workforce schedules included interactions between the schedule maker and the algorithm, including defining the length of sequences of consecutive days of working shifts. In this method, an algorithm takes into account inputs (or constraints) from the schedule maker and then presents the possible solutions (incl. that all shifts must be filled, working hours per week, minimal resting time, etc.) in a first phase. The schedule maker can then select which solutions are most feasible to proceed with in the second phase, where the final schedules are then constructed and exported.
