Packet Routing and Scheduling

By: Andreas Wiese

Write A Review

Paperback | 17 August 2011

At a Glance

Paperback
220 Pages

Dimensions(cm)
21.01 x 14.81 x 1.17

Paperback

$45.38

or 4 interest-free payments of $11.35 with

Ships in 5 to 7 business days

Among the most important problems in combinatorial optimization are scheduling problems. In this paper, machine scheduling is considered. Usually in such problems a set of jobs and a set of machines are given. The task is to assign the jobs to the machines and to determine a schedule for each machine. The schedule determines at what times the machine will process the jobs assigned to it. Often, constraints must be taken into account. Typical constraints are times by which certain jobs must be completed (deadlines), that some jobs can only be processed when certain other jobs are completed (precedence constraints), or that some jobs are only available from a given time (release dates).

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.