✦ LIBER ✦

The Lazy Bureaucrat scheduling problem

✍ Scribed by Esther M. Arkin; Michael A. Bender; Joseph S.B. Mitchell; Steven S. Skiena

Book ID: 114273368
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 195 KB
Volume: 184
Category: Article
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00060-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lazy bureaucrat scheduling with commo

On lazy bureaucrat scheduling with common deadlines

✍ Ling Gai; Guochuan Zhang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 264 KB

The Lazy Cook Problem, or Scheduling Two

The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

✍ Arbib, Claudio ;Marinelli, Fabrizio 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 431 KB

Scheduling algorithms for the lock sched

Scheduling algorithms for the lock scheduling problem

✍ Jannes Verstichel; Patrick De Causmaecker; Greet Vanden Berghe 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 375 KB

The poset scheduling problem

✍ Gerard J. Chang; Jack Edmonds 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 303 KB

The payment scheduling problem

✍ Richard C. Grinold 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

The payment scheduling problem

✍ Richard C. Grinold 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can