Single machine scheduling with resource dependent release times and processing times
Single machine scheduling with resource dependent release times and processing times
复制标题
DOI：
10.1016/j.ejor.2003.10.024
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
Xiuli Wang;T. Cheng
中科院分区：
文献类型：
--
作者：
Xiuli Wang;T. Cheng
研究了具有依赖于资源的放行时间和加工时间的单机排序问题，其中放行时间和加工时间都是资源消耗量的严格线性递减函数.目标是最小化最大完工时间加上总资源消耗成本。我们提出了一个启发式算法的一般问题，利用一些派生的最优性质，并分析其性能界。对于一些特殊的情况下，我们提出了另一种启发式算法，实现了更严格的性能约束。
We consider the single machine scheduling problem with resource dependent release times and processing times, in which both the release times and processing times are strictly linear decreasing functions of the amount of resources consumed. The objective is to minimize the makespan plus the total resource consumption costs. We propose a heuristic algorithm for the general problem by utilizing some derived optimal properties and analyze its performance bound. For some special cases, we propose another heuristic algorithm that achieves a tighter performance bound.