Scheduling Theory and Its ApplicationsISBN: 978-0-471-94059-3
Hardcover
384 pages
September 1995
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
Partial table of contents:
Computing Near-Optimal Schedules (J. Lenstra & D.Shmoys).
A Tutorial in Stochastic Scheduling (G. Weiss).
Scheduling with Communication Delays: A Survey (P. Chretienne &C. Picouleau).
Profile Scheduling by List Algorithms (Z. Liu & E.Sanlaville).
Real-Time Scheduling of Periodic Tasks (C. Chaouiya, et al.).
Some Graph Coloring Models for Cyclic Scheduling (D. de Werra &P. Solot).
Transforming Cyclic Scheduling Problems into Acyclic Ones (F.Gasperoni & U. Schwiegelshohn).
Application of Majorization to Control Problems in Queueing Systems(D. Towsley).
Dynamic Routing and Sequencing in Open Queueing Networks (C.Laws).
Indexes.
Computing Near-Optimal Schedules (J. Lenstra & D.Shmoys).
A Tutorial in Stochastic Scheduling (G. Weiss).
Scheduling with Communication Delays: A Survey (P. Chretienne &C. Picouleau).
Profile Scheduling by List Algorithms (Z. Liu & E.Sanlaville).
Real-Time Scheduling of Periodic Tasks (C. Chaouiya, et al.).
Some Graph Coloring Models for Cyclic Scheduling (D. de Werra &P. Solot).
Transforming Cyclic Scheduling Problems into Acyclic Ones (F.Gasperoni & U. Schwiegelshohn).
Application of Majorization to Control Problems in Queueing Systems(D. Towsley).
Dynamic Routing and Sequencing in Open Queueing Networks (C.Laws).
Indexes.
Related Titles
More By These Authors
Discrete Mathematics
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
