✦ LIBER ✦

Complexity results for the basic residency scheduling problem

✍ Scribed by Guo, Jiayi; Morrison, David R.; Jacobson, Sheldon H.; Jokela, Janet A.

Book ID: 121587408
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 293 KB
Volume: 17
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-013-0362-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Benchmarks for basic scheduling problems

✍ E. Taillard 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Complexity and approximation for schedul

Complexity and approximation for scheduling problem for a torpedo

✍ G. Simonin; R. Giroudeau; J.C. König 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 373 KB

A dynamic edge covering and scheduling p

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

✍ Jiaming Qiu, Thomas C. Sharkey 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

The basic cyclic scheduling problem with

The basic cyclic scheduling problem with deadlines

✍ Philippe Chretienne 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 971 KB

The counting complexity of a simple sche

The counting complexity of a simple scheduling problem

✍ Gerardo Berbeglia 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the

Complexity results for scheduling chains

Complexity results for scheduling chains on a single machine

✍ J.K. Lenstra; A.H.G. Rinnooy Kan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 597 KB