Scheduling : theory, algorithms, and systems / Michael L. Pinedo.
Pinedo, Michael.
2022
TS157.5
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title Scheduling : theory, algorithms, and systems / Michael L. Pinedo.
Author Pinedo, Michael.
Edition Sixth edition.
ISBN 9783031059216 (electronic bk.)
3031059212 (electronic bk.)
3031059204
9783031059209
DOI https://doi.org/10.1007/978-3-031-05921-6
Publication Details Cham, Switzerland : Springer, 2022.
Language English
Description 1 online resource
Item Number 10.1007/978-3-031-05921-6 doi
Call Number TS157.5
Dewey Decimal Classification 658.5/3
Summary The sixth edition provides expanded Discussion and Comments and References sections at the end of each chapter, creating a spotlight on practical applications of the theory presented in that chapter. New topics include rules for stochastic parallel machine scheduling and for stochastic online scheduling, models of flow shops with reentry, fixed parameter tractability, and new designs and implementations of scheduling systems. The main structure of the book as per previous edition consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped and streamlined and the references have been made up-to-date. Theoreticians and practitioners alike will find this book of interest. Graduate students in operations management, operations research, industrial engineering, and computer science will find the book an accessible and invaluable resource. Scheduling - Theory, Algorithms, and Systems will serve as an essential reference for professionals working on scheduling problems in manufacturing, services, and other environments. Michael L. Pinedo is the Julius Schlesinger Professor of Operations Management in the Stern School of Business at New York University. Review of third edition: "This well-established text covers both the theory and practice of scheduling. The book begins with motivating examples and the penultimate chapter discusses some commercial scheduling systems and examples of their implementations." (Mathematical Reviews, 2009).
Bibliography, etc. Note Includes bibliographical references and indexes.
Access Note Access limited to authorized users.
Source of Description Online resource; title from PDF title page (SpringerLink, viewed January 6, 2023).
Available in Other Form Print version: 9783031059209
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
Intro
Preface to the Sixth Edition
The Gantt Chart: Its Originators
Supplementary Electronic Material
Contents
1 Introduction
1.1 The Role of Scheduling
1.2 The Scheduling Function in an Enterprise
1.3 Outline of the Book
Part I Deterministic Models
2 Deterministic Models: Preliminaries
2.1 Framework and Notation
2.2 Examples
2.3 Classes of Schedules
2.4 Complexity Hierarchy
3 Single Machine Models (Deterministic)
3.1 The Total Weighted Completion Time
3.2 The Maximum Lateness
3.3 The Number of Tardy Jobs

3.4 The Total Tardiness-Dynamic Programming
3.5 The Total Tardiness-An Approximation Scheme
3.6 The Total Weighted Tardiness
3.7 Online Scheduling
3.8 Discussion
4 Advanced Single Machine Models (Deterministic)
4.1 The Total Earliness and Tardiness
4.2 Primary and Secondary Objectives
4.3 Multiple Objectives: A Parametric Analysis
4.4 The Makespan with Sequence Dependent Setup Times
4.5 Job Families with Setup Times
4.6 Batch Processing
4.7 Discussion
5 Parallel Machine Models (Deterministic)
5.1 The Makespan without Preemptions

5.2 The Makespan with Preemptions
5.3 The Total Completion Time without Preemptions
5.4 The Total Completion Time with Preemptions
5.5 Due Date Related Objectives
5.6 Online Scheduling
5.7 Discussion
6 Flow Shops and Flexible Flow Shops (Deterministic)
6.1 Flow Shops with Unlimited Intermediate Storage
6.2 Flow Shops with Limited Intermediate Storage
6.3 Proportionate Flow Shops with Unlimited and Limited Intermediate Storage
6.4 Proportionate Flow Shops with Reentry
6.5 Flexible Flow Shops with Unlimited Intermediate Storage
6.6 Discussion

7 Job Shops (Deterministic)
7.1 Disjunctive Programming and Branch and Bound
7.2 The Shifting Bottleneck Heuristic and the Makespan
7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness
7.4 Constraint Programming and the Makespan
7.5 Discussion
8 Open Shops (Deterministic)
8.1 The Makespan without Preemptions
8.2 The Makespan with Preemptions
8.3 The Maximum Lateness without Preemptions
8.4 The Maximum Lateness with Preemptions
8.5 The Number of Tardy Jobs
8.6 Discussion
Part II Stochastic Models
9 Stochastic Models: Preliminaries

9.1 Framework and Notation
9.2 Distributions and Classes of Distributions
9.3 Stochastic Dominance
9.4 Impact of Randomness on Fixed Schedules
9.5 Classes of Policies
10 Single Machine Models (Stochastic)
10.1 Arbitrary Distributions without Preemptions
10.2 Arbitrary Distributions with Preemptions: the Gittins Index
10.3 Likelihood Ratio Ordered Distributions
10.4 Exponential Distributions
10.5 Discussion
11 Single Machine Models with Release Dates (Stochastic)
11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions

Browse Subjects

Show more subjects...

Statistics

from
to
Export