Scheduling with time dependent processing times: Review and extensions
Scheduling with time dependent processing times: Review and extensions
复制标题
DOI：
10.1057/palgrave.jors.2600740
复制
发表时间：
1999-07
影响因子：
3.6
通讯作者：
B. Alidaee;K. Womer
中科院分区：
文献类型：
--
作者：
B. Alidaee;K. Womer
在经典调度理论中，工件的加工时间是常数。然而，在许多情况下，作业的处理时间取决于队列中作业的开始时间。本文回顾了快速增长的文献中的单机调度模型与时间依赖的加工时间。注意力集中在线性，分段线性和非线性加工时间函数的工作。我们调查已知的结果，并介绍新的可解的情况。最后，我们确定了需要进一步研究的领域和方向。
In classical scheduling theory job processing times are constant. However, there are many situations where processing time of a job depends on the starting time of the job in the queue. This paper reviews the rapidly growing literature on single machine scheduling models with time dependent processing times. Attention is focused on linear, piecewise linear and non-linear processing time functions for jobs. We survey known results and introduce new solvable cases. Finally, we identify the areas and give directions where further research is needed.