𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List scheduling for jobs with arbitrary release times and similar lengths

✍ Scribed by Rongheng Li; Huei-Chuen Huang

Publisher
Springer US
Year
2007
Tongue
English
Weight
343 KB
Volume
10
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-

A polynomial-time algorithm for the two-
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
✍ Vadim G. Timkovsky πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1014 KB

We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the machines have