Work force scheduling for arbitrary cyclic demands
研究如何确定最小全职员工数及排班表以满足任意循环的人员需求，提出更高效的算法，并首次用松弛分散度指标比较算法，发现效率与松弛分散度之间存在权衡。
Abstract The problem considered here is the determination of the minimum full‐time workforce and corresponding work schedule to meet arbitrary cyclic staffing requirements where all workers are idle either one or two consecutive periods per cycle. Specialized algorithms are developed which are less complex and consequently more efficient than existing algorithms. The new algorithms are also compared with alternative algorithms on the basis of slack dispersion which is a criterion that has not been previously considered in the literature. The results suggested the existence of a trade‐off between the execution efficiency of the algorithms and their slack dispersion characteristics. Some initial framework required for future research is also provided.