最大化的时间间隔之间的变化与公平的工作量分布

A simple procedure, combining random and greedy strategies with heuristics to maximize the minimal interval between consecutive shifts with multiple constraints on the workload distribution. In particular, the distribution of duties among the staff must be uniform when a number of roles and a variety of shift types are considered. The number of persons available for every shift type and role must be large compared to the number required in each case. The method also implements a strategy to deal with the suboptimal results of the simple approach when some unfrequent and aperiodic day types, such as long weekends, are considered.

dist
lib
ShiftSchedule.jar
doc
images
.svn
Info.html
Authors
LICENSE
README
TODO