BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Scheduling Algorithms

Scheduling Algorithms

Scheduling Algorithms
Stock photo: cover may vary

Scheduling Algorithms Hardback - 2007

by Peter Brucker

Add to wish list
  • Used
  • Hardback
Used - Good Condition

Description

[ Edition: fifth ]. Good Condition. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: SOME ] Publisher: Springer Pub Date: 3/12/2007 Binding: Hardcover Pages: 371
Ask the seller a question Add to wish list
A$73.94
A$6.21 Delivery within USA
Standard delivery: 4 to 14 days
More delivery options
Ships from BookHolders (Virginia, United States)

Details

  • Title Scheduling Algorithms
  • Author Peter Brucker
  • Binding Hardback
  • Edition [ Edition: fifth ]
  • Condition Used - Good Condition
  • Pages 371
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2007-02-06
  • Features Bibliography, Index, Table of Contents
  • Bookseller's Inventory # 6837255
  • ISBN 9783540695158 / 354069515X
  • Weight 1.5 lbs (0.68 kg)
  • Dimensions 9.2 x 6.3 x 1 in (23.37 x 16.00 x 2.54 cm)
  • Category Business / Economics / Finance
  • Library of Congress Catalogue Number 2006940721
  • Dewey Decimal Code 658.530
  • Quantity available 1

About BookHolders Virginia, United States

Biblio member since 2004

Cheap Books.

bookholders.com

Terms of Sale:

30 Day Return Policy.

Browse books from BookHolders

Reader reviews for Scheduling Algorithms

From the publisher

Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems.

From the rear cover

Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.
tracking-