Principles of Sequencing and Scheduling, 2nd Edition

Principles of Sequencing and Scheduling, 2nd Edition

by Kenneth R. Baker, Dan Trietsch
Released November 2018
Publisher(s): Wiley
ISBN: 9781119262565

Read it now on the O’Reilly learning platform with a 10-day free trial.

O’Reilly members get unlimited access to books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Book description

An updated edition of the text that explores the core topics in scheduling theory

The second edition of Principles of Sequencing and Scheduling has been revised and updated to provide comprehensive coverage of sequencing and scheduling topics as well as emerging developments in the field. The text offers balanced coverage of deterministic models and stochastic models and includes new developments in safe scheduling and project scheduling, including coverage of project analytics. These new topics help bridge the gap between classical scheduling and actual practice. The authors—noted experts in the field—present a coherent and detailed introduction to the basic models, problems, and methods of scheduling theory. 

This book offers an introduction and overview of sequencing and scheduling and covers such topics as single-machine and multi-machine models, deterministic and stochastic problem formulations, optimization and heuristic solution approaches, and generic and specialized software methods. This new edition adds coverage on topics of recent interest in shop scheduling and project scheduling. This important resource:

  • Offers comprehensive coverage of deterministic models as well as recent approaches and developments for stochastic models
  • Emphasizes the application of generic optimization software to basic sequencing problems and the use of spreadsheet-based optimization methods
  • Includes updated coverage on safe scheduling, lognormal modeling, and job selection
  • Provides basic coverage of robust scheduling as contrasted with safe scheduling
  • Adds a new chapter on project analytics, which supports the PERT21 framework for project scheduling in a stochastic environment.
  • Extends the coverage of PERT 21 to include hierarchical scheduling
  • Provides end-of-chapter references and access to advanced Research Notes, to aid readers in the further exploration of advanced topics  

Written for upper-undergraduate and graduate level courses covering such topics as scheduling theory and applications, project scheduling, and operations scheduling, the second edition of Principles of Sequencing and Scheduling is a resource that covers scheduling techniques and contains the most current research and emerging topics. 

Table of contents

  1. Cover
  2. Preface
    1. Coverage of the Text
    2. Historical Background
    3. New in the Second Edition
  3. 1 Introduction
    1. 1.1 Introduction to Sequencing and Scheduling
    2. 1.2 Scheduling Theory
    3. 1.3 Philosophy and Coverage of the Book
    4. Bibliography
  4. 2 Single‐machine Sequencing
    1. 2.1 Introduction
    2. 2.2 Preliminaries
    3. 2.3 Problems Without Due Dates: Elementary Results
    4. 2.4 Problems with Due Dates: Elementary Results
    5. 2.5 Flexibility in the Basic Model
    6. 2.6 Summary
    7. Exercises
    8. Bibliography
  5. 3 Optimization Methods for the Single‐machine Problem
    1. 3.1 Introduction
    2. 3.2 Adjacent Pairwise Interchange Methods
    3. 3.3 A Dynamic Programming Approach
    4. 3.4 Dominance Properties
    5. 3.5 A Branch‐and‐bound Approach
    6. 3.6 Integer Programming
    7. 3.7 Summary
    8. Exercises
    9. Bibliography
  6. 4 Heuristic Methods for the Single‐machine Problem
    1. 4.1 Introduction
    2. 4.2 Dispatching and Construction Procedures
    3. 4.3 Random Sampling
    4. 4.4 Neighborhood Search Techniques
    5. 4.5 Tabu Search
    6. 4.6 Simulated Annealing
    7. 4.7 Genetic Algorithms
    8. 4.8 The Evolutionary Solver
    9. 4.9 Summary
    10. Exercises
    11. Bibliography
  7. 5 Earliness and Tardiness Costs
    1. 5.1 Introduction
    2. 5.2 Minimizing Deviations from a Common Due Date
    3. 5.3 The Restricted Version
    4. 5.4 Asymmetric Earliness and Tardiness Costs
    5. 5.5 Quadratic Costs
    6. 5.6 Job‐dependent Costs
    7. 5.7 Distinct Due Dates
    8. 5.8 Summary
    9. Exercises
    10. Bibliography
  8. 6 Sequencing for Stochastic Scheduling
    1. 6.1 Introduction
    2. 6.2 Basic Stochastic Counterpart Models
    3. 6.3 The Deterministic Counterpart
    4. 6.4 Minimizing the Maximum Cost
    5. 6.5 The Jensen Gap
    6. 6.6 Stochastic Dominance and Association
    7. 6.7 Using Analytic Solver Platform
    8. 6.8 Non‐probabilistic Approaches: Fuzzy and Robust Scheduling
    9. 6.9 Summary
    10. Exercises
    11. Bibliography
  9. 7 Safe Scheduling
    1. 7.1 Introduction
    2. 7.2 Meeting Service Level Targets
    3. 7.3 Trading Off Tightness and Tardiness
    4. 7.4 The Stochastic E/T Problem
    5. 7.5 Using the Lognormal Distribution
    6. 7.6 Setting Release Dates
    7. 7.7 The Stochastic U‐problem: A Service‐level Approach
    8. 7.8 The Stochastic U‐problem: An Economic Approach
    9. 7.9 Summary
    10. Exercises
    11. Bibliography
  10. 8 Extensions of the Basic Model
    1. 8.1 Introduction
    2. 8.2 Nonsimultaneous Arrivals
    3. 8.3 Related Jobs
    4. 8.4 Sequence‐Dependent Setup Times
    5. 8.5 Stochastic Traveling Salesperson Models
    6. 8.6 Summary
    7. Exercises
    8. Bibliography
  11. 9 Parallel‐machine Models
    1. 9.1 Introduction
    2. 9.2 Minimizing the Makespan
    3. 9.3 Minimizing Total Flowtime
    4. 9.4 Stochastic Models
    5. 9.5 Summary
    6. Exercises
    7. Bibliography
  12. 10 Flow Shop Scheduling
    1. 10.1 Introduction
    2. 10.2 Permutation Schedules
    3. 10.3 The Two‐machine Problem
    4. 10.4 Special Cases of the Three‐machine Problem
    5. 10.5 Minimizing the Makespan
    6. 10.6 Variations of the m‐Machine Model
    7. 10.7 Summary
    8. Exercises
    9. Bibliography
  13. 11 Stochastic Flow Shop Scheduling
    1. 11.1 Introduction
    2. 11.2 Stochastic Counterpart Models
    3. 11.3 Safe Scheduling Models with Stochastic Independence
    4. 11.4 Flow Shops with Linear Association
    5. 11.5 Empirical Observations
    6. 11.6 Summary
    7. Exercises
    8. Bibliography
  14. 12 Lot Streaming Procedures for the Flow Shop
    1. 12.1 Introduction
    2. 12.2 The Basic Two‐machine Model
    3. 12.3 The Three‐machine Model with Consistent Sublots
    4. 12.4 The Three‐machine Model with Variable Sublots
    5. 12.5 The Fundamental Partition
    6. 12.6 Summary
    7. Exercises
    8. Bibliography
  15. 13 Scheduling Groups of Jobs
    1. 13.1 Introduction
    2. 13.2 Scheduling Job Families
    3. 13.3 Scheduling with Batch Availability
    4. 13.4 Scheduling with a Batch Processor
    5. 13.5 Summary
    6. Exercises
    7. Bibliography
  16. 14 The Job Shop Problem
    1. 14.1 Introduction
    2. 14.2 Types of Schedules
    3. 14.3 Schedule Generation
    4. 14.4 The Shifting Bottleneck Procedure
    5. 14.5 Neighborhood Search Heuristics
    6. 14.6 Summary
    7. Exercises
    8. Bibliography
  17. 15 Simulation Models for the Dynamic Job Shop
    1. 15.1 Introduction
    2. 15.2 Model Elements
    3. 15.3 Types of Dispatching Rules
    4. 15.4 Reducing Mean Flowtime
    5. 15.5 Meeting Due Dates
    6. 15.6 Summary
    7. Bibliography
  18. 16 Network Methods for Project Scheduling
    1. 16.1 Introduction
    2. 16.2 Logical Constraints And Network Construction
    3. 16.3 Temporal Analysis of Networks
    4. 16.4 The Time/Cost Trade‐off
    5. 16.5 Traditional Probabilistic Network Analysis
    6. 16.6 Summary
    7. Exercises
    8. Bibliography
  19. 17 Resource‐Constrained Project Scheduling
    1. 17.1 Introduction
    2. 17.2 Extending the Job Shop Model
    3. 17.3 Extending the Project Model
    4. 17.4 Heuristic Construction and Search Algorithms
    5. 17.5 Stochastic Sequencing with Limited Resources
    6. 17.6 Summary
    7. Bibliography
  20. 18 Project Analytics
    1. 18.1 Introduction
    2. 18.2 Basic Partitioning
    3. 18.3 Correcting for Rounding
    4. 18.4 Accounting for the Parkinson Effect
    5. 18.5 Identifying Mixtures
    6. 18.6 Addressing Subjective Estimation Bias
    7. 18.7 Linear Association
    8. 18.8 Summary
    9. Bibliography
  21. 19 PERT 21
    1. 19.1 Introduction
    2. 19.2 Stochastic Balance Principles for Activity Networks
    3. 19.3 Hierarchical Balancing and Progress Payments
    4. 19.4 Crashing Stochastic Activities
    5. 19.5 Summary
    6. Exercises
    7. Bibliography
  22. Appendix A: Practical Processing Time Distributions
    1. A.1 Important Processing Time Distributions
    2. A.2 Mixtures of Distributions
    3. A.3 Increasing and Decreasing Completion Rates
    4. A.4 Stochastic Dominance
    5. A.5 Linearly Associated Processing Times
    6. Bibliography
  23. Appendix B: The Critical Ratio Rule
    1. B.1 A Basic Trade‐off Problem
    2. B.2 Optimal Policy for Discrete Probability Models
    3. B.3 A Special Discrete Case: Equally Likely Outcomes
    4. B.4 Optimal Policy for Continuous Probability Models
    5. B.5 A Special Continuous Case: The Normal Distribution
    6. B.6 Calculating d + γE(T) for the Normal Distribution
    7. B.7 Calculations for the Lognormal Distribution
    8. Bibliography
  24. Index
  25. End User License Agreement

Product information

  • Title: Principles of Sequencing and Scheduling, 2nd Edition
  • Author(s): Kenneth R. Baker, Dan Trietsch
  • Release date: November 2018
  • Publisher(s): Wiley
  • ISBN: 9781119262565