|Listed in category:
Have one to sell?

Scheduling Algorithms by Peter Brucker: New

US $155.72
ApproximatelyC $213.74
Condition:
Brand New
Breathe easy. Returns accepted.
Shipping:
Free Standard Shipping.
Located in: Sparks, Nevada, United States
Delivery:
Estimated between Wed, Jul 23 and Tue, Jul 29 to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Payments:
     Diners Club

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:285045406987
Last updated on Apr 03, 2024 08:55:39 EDTView all revisionsView all revisions

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See the ...
Book Title
Scheduling Algorithms
Publication Date
2007-02-06
Edition Number
5
Pages
371
ISBN
9783540695158

About this product

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
354069515X
ISBN-13
9783540695158
eBay Product ID (ePID)
28038700827

Product Key Features

Number of Pages
Xii, 371 Pages
Language
English
Publication Name
Scheduling Algorithms
Subject
Programming / Algorithms, Industrial Management, Operations Research, Management Science, Data Processing, Production & Operations Management
Publication Year
2007
Features
Revised
Type
Textbook
Subject Area
Computers, Business & Economics
Author
Peter Brucker
Format
Hardcover

Dimensions

Item Height
0.4 in
Item Weight
27.2 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Edition Number
5
Intended Audience
Scholarly & Professional
LCCN
2006-940721
Dewey Edition
22
Reviews
From the reviews of the fourth edition: "This is a book about scheduling algorithms. ... The book contains eleven chapters. ... Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and now contains 198 references. The book is well organized. It will be useful for specialists in scheduling theory and in combinatorial optimization." (I.N. Lushchakova, Zentralblatt MATH, Vol. 1060, 2005) From the reviews of the fifth edition: "One of the competitive books on the theory of machine scheduling in the market, this book, now in its fifth edition, was first published in 1995. ... This book is theoretically oriented with little treatment of practical issues. It is suitable for researchers and graduate students in mathematics, computer science, operations research, management science, and industrial engineering. ... To summarize, this is an excellent theoretically oriented reference book written by an expert on the classical results of deterministic machine scheduling." (Donglei Du, SIAM Review, Vol. 50 (1), 2008), From the reviews of the fourth edition: "This is a book about scheduling algorithms. ? The book contains eleven chapters. ? Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and now contains 198 references. The book is well organized. It will be useful for specialists in scheduling theory and in combinatorial optimization." (I.N. Lushchakova, Zentralblatt MATH, Vol. 1060, 2005), From the reviews of the fourth edition:"This is a book about scheduling algorithms. … The book contains eleven chapters. … Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and now contains 198 references. The book is well organized. It will be useful for specialists in scheduling theory and in combinatorial optimization." (I.N. Lushchakova, Zentralblatt MATH, Vol. 1060, 2005)From the reviews of the fifth edition:"One of the competitive books on the theory of machine scheduling in the market, this book, now in its fifth edition, was first published in 1995. … This book is theoretically oriented with little treatment of practical issues. It is suitable for researchers and graduate students in mathematics, computer science, operations research, management science, and industrial engineering. … To summarize, this is an excellent theoretically oriented reference book written by an expert on the classical results of deterministic machine scheduling." (Donglei Du, SIAM Review, Vol. 50 (1), 2008)
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
658.5/3
Table Of Content
Classification of Scheduling Problems.- Some Problems in Combinatorial Optimization.- Computational Complexity.- Single Machine Scheduling Problems.- Parallel Machines.- Shop Scheduling Problems.- Due-Date Scheduling.- Batching Problems.- Changeover Times and Transportation Times.- Multi-Purpose Machines.- Multiprocessor Tasks.
Edition Description
Revised edition
Synopsis
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., 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.
LC Classification Number
T57.6-.97

Item description from the seller

About this seller

AlibrisBooks

98.6% positive feedback1.9M items sold

Joined May 2008
Alibris is the premier online marketplace for independent sellers of new & used books, as well as rare & collectible titles. We connect people who love books to thousands of independent sellers around ...
See more

Detailed seller ratings

Average for the last 12 months
Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
4.9

Seller feedback (511,850)

All ratings
Positive
Neutral
Negative
  • m***m (2282)- Feedback left by buyer.
    Past month
    Verified purchase
    I’m thrilled with my recent purchase . The website was user-friendly, and the product descriptions were accurate. Customer service was prompt and helpful, answering all my questions. My order arrived quickly, well-packaged, and the product exceeded my expectations in quality. I’m impressed with the attention to detail and the overall experience. I’ll definitely shop here again and highly recommend from this seller to others. Thank you for a fantastic experience!
  • a***n (43)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    Mistakenly ordered a paperback that I thought was a hardcover, not sellers fault; it was described properly on the listing. Seller still processed a refund the day I went to return the item and let me keep the item anyway. A+++ service. Book arrived quickly in great condition and for a great price. Thank you so much! Amazing seller!
  • n***c (94)- Feedback left by buyer.
    Past month
    Verified purchase
    seller was communicative about my shipment, media mail took a while and tracking wasn't updated frequently, but seller communicated to me very quickly on status. the item came new and wrapped as described, though the packaging in it was packed wasn't sturdy and falling apart when it got to me.