Efficient scheduling of resources is critical to the proper functioning of businesses in today's competitive environment. Scheduling focuses on theoretical as well as applied aspects of the scheduling of resources. It is unique in the range of problems and issues that it covers. The book consists of three parts. The first part focuses on deterministic scheduling and deals with the combinational problems that arise in deterministic scheduling. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance with certainty. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and also delves into system design and developmental issues. INCLUDES: *Discussion of the basic properties of scheduling models. *Computational as well as theoretical exercises at the end of each chapter. *Thorough examination of numerous applications. *Investigation of the latest developments in the field. *Discussion of future research developments. A software package especially designed for the readers of this text is available free of charge on the web.Known as LEKIN, this system covers most of the machine environments discussed in this book and enables the user to test many of the algorithms and heuristics described. This book is of interest to theoreticians and practitioners alike. Graduate students in operations research, industrial engineering, and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Editorial Reviews
Review
From the reviews of the third edition: "This well-established text covers both the theory and practice of scheduling. … the text covers a wide range of topics, sometimes adopting a theoretical and at other times a more practical approach. The presentation throughout is clear and elegant with plentiful diagrams to assist the student. The book should be very useful to graduate students, instructors and researchers in the field of scheduling and to the wider operations research community." (Andrew Wirth, Mathematical Reviews, Issue 2009 e)
--This text refers to an out of print or unavailable edition of this title.
From the Publisher
Dealing primarily with machine scheduling models, Pinedo's three-part approach covers deterministic models, stochastic models and applications in the real world.
--This text refers to an out of print or unavailable edition of this title.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
19 of 21 people found the following review helpful:
5.0 out of 5 stars
A nice book on machine scheduling,
By A Customer
This review is from: Scheduling: Theory, Algorithms and Systems (Hardcover)
Pinedo's book is an excellent reference for almost all problems in machine scheduling. The author is very economic with words and yet the explanations are incredibly clear. I use it for a graduate course in Scheduling that I teach. I often find myself referring to it whenever I need to review some particular class of scheduling problems. There is a chapter on metaheuristics that explains how these methods work - this is a bonus given that the book concentrates on theoretically rigorous methods. What I really like is the fact that step-by-step descriptions of many algorithms are provided, which can be used directly to write computer programs. The interested reader will find results related to structures of many scheduling problems. Overall this is a great book for teaching and research reference purposes. I have read two other texts on scheduling and I must say that this is by far the best.
4 of 4 people found the following review helpful:
5.0 out of 5 stars
In a class by itself,
By
Amazon Verified Purchase(What's this?)
This review is from: Scheduling: Theory, Algorithms, and Systems (Hardcover)
This book (and its previous two editions) is in a class by itself for scheduling theory. Although it is oriented toward machine scheduling, there is a lot of material that traditional real-time scheduling researchers and practitioners ought to become aware of if they want to move out of their historical niche. There are several other books that are devoted to deterministic scheduling, but this one includes stochastic scheduling -- much of the real world is non-deterministic. The book is well written and easy to read. This edition's new material is especially welcome because the author continues to emphasize the practicality of scheduling theory.
13 of 17 people found the following review helpful:
4.0 out of 5 stars
Excellent literature review, Great Theories But... Expensive,
This review is from: Scheduling: Theory, Algorithms and Systems (Hardcover)
Pinedo did an excellent job for compiling the stories of scheduling system. For a new researcher/grad student in scheduling issue, this is the book that you need -before jump to library and search through all journals. The organization is slightly complicate. So readers may need to prepare their study plan before going through the book from cover to cover. I don't own this book, still; just read it from the library. This book deserves 5 or even 6 stars if the price is more affordable. I wish I have it when got a real job after graduation.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
single machine models, production scheduler, parallel machine models, flow shops, travelling salesman problem, flexible flow line, optimal value function, ant colony optimization, dynamic balancing, complexity hierarchy, profile fitting, minimizing makespan, minimizing total tardiness, machine learning mechanisms, minimizing maximum lateness, exponential distributions, due date related objectives, minimizing total completion time, shortest processing time, smallest variance, earliest due date, material requirements planning, total expected completion time, nonpreemptive static list policies, static list policy Key Phrases - Capitalized Phrases (CAPs): (learn more)
Job Shops, Springer Science, Business Media, Deterministic Models, Open Shops, Stochastic Models, Design of Scheduling, More Advanced General Purpose Procedures, Basic Concepts, Arbitrary Distributions, More Advanced Concepts, Round Robin, Recursive Relation, Initial Condition, Apply Algorithm, Consider Example, First Come First Served, Apparent Tardiness Cost, The Number of Tardy Jobs, Job Families, Schedule Board, Largest Variance, Prove Lemma, Taylor Scheduling Software, Operations Research Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
single machine models, production scheduler, parallel machine models, flow shops, travelling salesman problem, flexible flow line, optimal value function, ant colony optimization, dynamic balancing, complexity hierarchy, profile fitting, minimizing makespan, minimizing total tardiness, machine learning mechanisms, minimizing maximum lateness, exponential distributions, due date related objectives, minimizing total completion time, shortest processing time, smallest variance, earliest due date, material requirements planning, total expected completion time, nonpreemptive static list policies, static list policy Key Phrases - Capitalized Phrases (CAPs): (learn more)
Job Shops, Springer Science, Business Media, Deterministic Models, Open Shops, Stochastic Models, Design of Scheduling, More Advanced General Purpose Procedures, Basic Concepts, Arbitrary Distributions, More Advanced Concepts, Round Robin, Recursive Relation, Initial Condition, Apply Algorithm, Consider Example, First Come First Served, Apparent Tardiness Cost, The Number of Tardy Jobs, Job Families, Schedule Board, Largest Variance, Prove Lemma, Taylor Scheduling Software, Operations Research Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
