Departamento de Lenguajes y Sistemas Informáticos, Universidad de Alicante, Carretera de San Vicente SN, E-03071 Alicante, Spain.
Comput Methods Programs Biomed. 2010 Nov;100(2):191-9. doi: 10.1016/j.cmpb.2010.03.015. Epub 2010 May 10.
Although optimal staff scheduling often requires elaborate computational methods, those cases which are not highly constrained can be efficiently solved using simpler approaches. This paper describes how a simple procedure, combining random and greedy strategies with heuristics, has been successfully applied in a Spanish hospital to assign guard shifts to the physicians in a department. In this case, the employees prefer that their guard duties are regularly distributed in time. The workload distribution must also satisfy some constraints: in particular, the distribution of duties among the staff must be uniform when a number of tasks and shift types (including some unfrequent and aperiodic types, such as those scheduled during long weekends) are considered. Furthermore, the composition of teams should be varied, in the sense that no particular pairing should dominate the assignments. The procedure proposed is able to find suitable solutions when the number of employees available for every task is not small compared to the number required at every shift. The software is distributed under the terms of the GNU General Public License.
虽然最优的员工排班通常需要复杂的计算方法，但对于那些约束条件不高的情况，可以使用更简单的方法来有效地解决。本文描述了一种简单的方法，该方法将随机策略和贪婪策略与启发式算法相结合，已成功应用于西班牙的一家医院，为该医院的医生安排值班。在这种情况下，员工希望他们的值班任务能在时间上均匀分配。工作量的分配还必须满足一些约束条件：特别是，当考虑到许多任务和班次类型（包括一些不频繁和不定期的班次，例如在长周末期间安排的班次）时，员工之间的任务分配必须均匀。此外，团队的组成应该多样化，也就是说，不应该有特定的组合在任务分配中占主导地位。当每个任务可用的员工人数与每个班次所需的人数相比不小的情况下，所提出的方法能够找到合适的解决方案。该软件根据 GNU 通用公共许可证的条款发布。
