✦ LIBER ✦

Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines

✍ Scribed by F. Tercinet; C. Lenté; E. Néron

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 197 KB
Volume: 32
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2003.08.008

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate classical satisÿability tests for P|ri; di|-. Our motivation is to use the complementarity of classical preemptive relaxation and energetic reasoning. Thus minimum capacity constraints, based on the notion of mandatory parts of activities, are added to the classical max-ow formulation.

📜 SIMILAR VOLUMES

Bounds for naive multiple machine schedu

Bounds for naive multiple machine scheduling with release times and deadlines

✍ Dan Gusfield 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Dynasearch for the earliness–tardiness s

Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints

✍ Francis Sourd 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also