首页|Inverse interval scheduling via reduction on a single machine
Inverse interval scheduling via reduction on a single machine
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
We consider an inverse counterpart of the interval scheduling problem. In the problem, we are given a set of machines and the objective is to reduce the non-preemptive job intervals with a least cost so that all jobs with positive processing times may be scheduled on the machines. The paper focuses on the single machine case. We establish the strong NP-hardness of the problem and show however it admits a polynomial time approximation scheme.(c) 2022 Elsevier B.V. All rights reserved.
NSTL
Elsevier
