๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Online scheduling with preemption or non-completion penalties

โœ Scribed by Stanley P. Y. Fung


Book ID
120729809
Publisher
Springer US
Year
2013
Tongue
English
Weight
331 KB
Volume
17
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling with job release dates, deliv
โœ Zhaohui Liu; T.C.Edwin Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 73 KB

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-