✦ LIBER ✦

Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times

✍ Scribed by Monaldo Mastrolilli

Book ID: 111559249
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 112 KB
Volume: 6
Category: Article
ISSN: 1094-6136
DOI: 10.1023/a:1026272526225

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-

Preemptive scheduling with release dates

Preemptive scheduling with release dates, delivery times and sequence independent setup times

✍ Stanisław Zdrzałka 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 757 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times and delivery times

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for scheduling problems with time lags

✍ Xiandong Zhang; Steef van de Velde 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 322 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Scheduling jobs on a single machine with

Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis

✍ Stanisław Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 294 KB