✦ LIBER ✦

The complexity of scheduling a site visit

✍ Scribed by Eileen Frazer

Book ID: 116206845
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 197 KB
Volume: 23
Category: Article
ISSN: 1532-6497
DOI: 10.1016/j.amj.2004.08.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling a Site Visit

✍ Eileen Frazer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 88 KB

Scheduling the first prenatal visit: a m

Scheduling the first prenatal visit: a missed opportunity

✍ Arnold W. Cohen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Complexity of the scheduling languageRSV

✍ Pok-Son Kim; Arne Kutzner; Taehoon Park 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 777 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

On the Complexity of Adjacent Resource S

On the Complexity of Adjacent Resource Scheduling

✍ C. W. Duin; E. Van Der Sluis 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 438 KB

On the complexity of coupled-task schedu

On the complexity of coupled-task scheduling

✍ A.J. Orman; C.N. Potts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 873 KB