 Scheduling Theory and Its Applications
ISBN: 978-0-471-94059-3
Hardcover
382 pages
June 1995
US $240.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 1-2 days delivery time for paperbacks, and 3-5 days for hardcovers. 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.
