Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
复制标题
DOI：
10.1007/s10898-018-0686-2
复制
发表时间：
2018-07
影响因子：
1.8
通讯作者：
A. Shioura;N. V. Shakhlevich;V. Strusevich
中科院分区：
文献类型：
--
作者：
A. Shioura;N. V. Shakhlevich;V. Strusevich
我们考虑了一系列具有可控处理时间的调度问题，其中作业必须通过适当压缩其处理时间在一个共同的截止日期前完成。目标是最小化最大压缩成本。我们提出了一些基于通用原则的算法，以减少最终的运行时间。
We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times. The objective is to minimize the maximum compression cost. We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times.