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 Brucker, Peter

Add to wish list
  • New
  • Hardback
New

Description

Springer, 2007-02-06. Hardcover. New. In shrink wrap. Looks like an interesting title!
Ask the seller a question Add to wish list
A$302.94
A$8.67 Delivery within USA
Standard delivery: 2 to 21 days
More delivery options
Ships from GridFreed LLC (California, United States)

Details

  • Title Scheduling Algorithms
  • Author Brucker, Peter
  • Binding Hardback
  • Edition 5th
  • Condition New
  • Pages 371
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2007-02-06
  • Features Bibliography, Index, Table of Contents
  • Bookseller's Inventory # Q-354069515X
  • 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 GridFreed LLC California, United States

Biblio member since 2021

We sell primarily non-fiction, many new books, some collectible first editions and signed books. We operate 100% online and have been in business since 2005.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GridFreed LLC

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-