A dynamic programming approach to work force scheduling with time‐dependent performance measures
提出隐式枚举算法求解商业银行支票处理编码员排班问题，考虑浮存成本和时间因素，用一天时间范围反映兼职和全职人员的灵活性，与其它方法比较显示动态规划有效。
Abstract An implicit enumeration algorithm is defined to obtain solutions to the commercial bank check processing encoder scheduling problem. The specific application is of particular interest because a significant factor in determining optimality is the float costs associated with checks which are unprocessed and unavailable for presentation at check clearing deadlines, thereby making the timing of the activity of crucial importance. A one day time horizon is employed to reflect those situations where banks have the scheduling flexibility afforded by part‐time and/or temporary help in additon to a complement of full‐time operators. Comparisons are made with other suggested approaches to daily encoder scheduling. Results indicate that dynamic programming can be an attractive methodology to attack this complex problem.