A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities
针对需求已知但随时间变化、且常规和加班生产能力也随时间变化的情况，提出一个简单的手工可操作的启发式算法，以最小化总成本（包括设置、持有和加班溢价成本），测试显示平均成本偏差仅0.5%。
Abstract The problem considered in this paper deals with the sizing and timing of replenishments for an item facing a time‐varying, but known, pattern of requirements. Regular time and overtime (the latter at a cost premium) production options are available where there are production capacities that also can vary with time. The problem is to establish the pattern of replenishments so as to keep the total of setup, carrying and overtime premium costs as low as possible without any backlogging of demand and without violating any of the capacity constraints. A heuristic procedure, simple enough to implement manually, is developed and tested on a large representative set of problems. The resulting performance is excellent, namely an average cost penalty of only 0.5%.