𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties

✍ Scribed by Zhaohui Liu; T.C.Edwin Cheng

Book ID
111594822
Publisher
Springer US
Year
2004
Tongue
English
Weight
154 KB
Volume
7
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling with job release dates, deliv
Scheduling with job release dates, delivery times and preemption penalties
✍ 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-

Scheduling of a single machine to minimi
Scheduling of a single machine to minimize total weighted completion time subject to release dates
✍ Lucio Bianco; Salvatore Ricciardelli πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 764 KB

## Abstract In this paper the __n__/1/__r__~j~ Ξ£~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are