One Scheduling Problem with Rejection
Yuan Li-hua · Journal of Luoyang Institute of Science and Technology · 2010
In this paper,we mainly consider the scheduling with rejection.The objective function is to minimize the maximum completion time of the processed ones when the total compression cost is given.Firstly,we prove that the problem is NP-hard.Then,we design a pseudo-polynomial time dynamic algorithm and work out the FPTAS.