Scheduling with job release dates, delivery times and preemption penalties
暂无分享,去创建一个
We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-hard. Then, we present a dynamic programming algorithm and a polynomial time approximation scheme.
[1] David B. Shmoys,et al. Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..
[2] Michael J. Magazine,et al. Generalized preemption models for single-machine dynamic scheduling problems , 1997 .
[3] W. A. Horn. Some simple scheduling algorithms , 1974 .
[4] Gerhard J. Woeginger,et al. Preemptive scheduling with job-dependent setup times , 1999, SODA '99.