{"product_id":"principles-of-sequencing-and-scheduling-isbn-9781119262565","title":"Principles of Sequencing and Scheduling","description":"\u003cp\u003e\u003cb\u003eAn updated edition of the text that explores the core topics in scheduling theory\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eThe second edition of \u003ci\u003ePrinciples of Sequencing and Scheduling\u003c\/i\u003e 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. \u003c\/p\u003e \u003cp\u003eThis 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:\u003c\/p\u003e \u003cul\u003e \u003cli\u003eOffers comprehensive coverage of deterministic models as well as recent approaches and developments for stochastic models\u003c\/li\u003e \u003cli\u003eEmphasizes the application of generic optimization software to basic sequencing problems and the use of spreadsheet-based optimization methods\u003c\/li\u003e \u003cli\u003eIncludes updated coverage on safe scheduling, lognormal modeling, and job selection\u003c\/li\u003e \u003cli\u003eProvides basic coverage of robust scheduling as contrasted with safe scheduling\u003c\/li\u003e \u003cli\u003eAdds a new chapter on project analytics, which supports the PERT21 framework for project scheduling in a stochastic environment.\u003c\/li\u003e \u003cli\u003eExtends the coverage of PERT 21 to include hierarchical scheduling\u003c\/li\u003e \u003cli\u003eProvides end-of-chapter references and access to advanced Research Notes, to aid readers in the further exploration of advanced topics  \u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eWritten for upper-undergraduate and graduate level courses covering such topics as scheduling theory and applications, project scheduling, and operations scheduling, the second edition of \u003ci\u003ePrinciples of Sequencing and Scheduling \u003c\/i\u003eis a resource that covers scheduling techniques and contains the most current research and emerging topics. \u003c\/p\u003e \u003cp\u003ePreface xiii\u003c\/p\u003e \u003cp\u003eAcknowledgments xvii\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Introduction 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Introduction to Sequencing and Scheduling 1\u003c\/p\u003e \u003cp\u003e1.2 Scheduling Theory 4\u003c\/p\u003e \u003cp\u003e1.3 Philosophy and Coverage of the Book 6\u003c\/p\u003e \u003cp\u003eBibliography 8\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Single-machine Sequencing 11\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Introduction 11\u003c\/p\u003e \u003cp\u003e2.2 Preliminaries 12\u003c\/p\u003e \u003cp\u003e2.3 Problems Without Due Dates: Elementary Results 15\u003c\/p\u003e \u003cp\u003e2.3.1 Flowtime and Inventory 15\u003c\/p\u003e \u003cp\u003e2.3.2 Minimizing Total Flowtime 17\u003c\/p\u003e \u003cp\u003e2.3.3 Minimizing Total Weighted Flowtime 20\u003c\/p\u003e \u003cp\u003e2.4 Problems with Due Dates: Elementary Results 22\u003c\/p\u003e \u003cp\u003e2.4.1 Lateness Criteria 22\u003c\/p\u003e \u003cp\u003e2.4.2 Minimizing the Number of Tardy Jobs 25\u003c\/p\u003e \u003cp\u003e2.4.3 Minimizing Total Tardiness 26\u003c\/p\u003e \u003cp\u003e2.5 Flexibility in the Basic Model 30\u003c\/p\u003e \u003cp\u003e2.5.1 Due Dates as Decisions 30\u003c\/p\u003e \u003cp\u003e2.5.2 Job Selection Decisions 32\u003c\/p\u003e \u003cp\u003e2.6 Summary 34\u003c\/p\u003e \u003cp\u003eExercises 35\u003c\/p\u003e \u003cp\u003eBibliography 37\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Optimization Methods for the Single-machine Problem 39\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Introduction 39\u003c\/p\u003e \u003cp\u003e3.2 Adjacent Pairwise Interchange Methods 41\u003c\/p\u003e \u003cp\u003e3.3 A Dynamic Programming Approach 42\u003c\/p\u003e \u003cp\u003e3.4 Dominance Properties 48\u003c\/p\u003e \u003cp\u003e3.5 A Branch-and-bound Approach 52\u003c\/p\u003e \u003cp\u003e3.6 Integer Programming 59\u003c\/p\u003e \u003cp\u003e3.6.1 Minimizing the Weighted Number of Tardy Jobs 60\u003c\/p\u003e \u003cp\u003e3.6.2 Minimizing Total Tardiness 63\u003c\/p\u003e \u003cp\u003e3.7 Summary 65\u003c\/p\u003e \u003cp\u003eExercises 67\u003c\/p\u003e \u003cp\u003eBibliography 68\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Heuristic Methods for the Single-machine Problem 71\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Introduction 71\u003c\/p\u003e \u003cp\u003e4.2 Dispatching and Construction Procedures 72\u003c\/p\u003e \u003cp\u003e4.3 Random Sampling 77\u003c\/p\u003e \u003cp\u003e4.4 Neighborhood Search Techniques 81\u003c\/p\u003e \u003cp\u003e4.5 Tabu Search 85\u003c\/p\u003e \u003cp\u003e4.6 Simulated Annealing 87\u003c\/p\u003e \u003cp\u003e4.7 Genetic Algorithms 89\u003c\/p\u003e \u003cp\u003e4.8 The Evolutionary Solver 91\u003c\/p\u003e \u003cp\u003e4.9 Summary 96\u003c\/p\u003e \u003cp\u003eExercises 100\u003c\/p\u003e \u003cp\u003eBibliography 103\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Earliness and Tardiness Costs 105\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Introduction 105\u003c\/p\u003e \u003cp\u003e5.2 Minimizing Deviations from a Common Due Date 107\u003c\/p\u003e \u003cp\u003e5.2.1 Four Basic Results 107\u003c\/p\u003e \u003cp\u003e5.2.2 Due Dates as Decisions 112\u003c\/p\u003e \u003cp\u003e5.3 The Restricted Version 113\u003c\/p\u003e \u003cp\u003e5.4 Asymmetric Earliness and Tardiness Costs 116\u003c\/p\u003e \u003cp\u003e5.5 Quadratic Costs 118\u003c\/p\u003e \u003cp\u003e5.6 Job-dependent Costs 120\u003c\/p\u003e \u003cp\u003e5.7 Distinct Due Dates 120\u003c\/p\u003e \u003cp\u003e5.8 Summary 124\u003c\/p\u003e \u003cp\u003eExercises 125\u003c\/p\u003e \u003cp\u003eBibliography 126\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Sequencing for Stochastic Scheduling 129\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Introduction 129\u003c\/p\u003e \u003cp\u003e6.2 Basic Stochastic Counterpart Models 130\u003c\/p\u003e \u003cp\u003e6.3 The Deterministic Counterpart 137\u003c\/p\u003e \u003cp\u003e6.4 Minimizing the Maximum Cost 139\u003c\/p\u003e \u003cp\u003e6.5 The Jensen Gap 144\u003c\/p\u003e \u003cp\u003e6.6 Stochastic Dominance and Association 145\u003c\/p\u003e \u003cp\u003e6.7 Using Analytic Solver Platform 149\u003c\/p\u003e \u003cp\u003e6.8 Non-probabilistic Approaches: Fuzzy and Robust Scheduling 154\u003c\/p\u003e \u003cp\u003e6.9 Summary 161\u003c\/p\u003e \u003cp\u003eExercises 163\u003c\/p\u003e \u003cp\u003eBibliography 166\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Safe Scheduling 167\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Introduction 167\u003c\/p\u003e \u003cp\u003e7.2 Meeting Service Level Targets 169\u003c\/p\u003e \u003cp\u003e7.2.1 Sample-based Analysis 169\u003c\/p\u003e \u003cp\u003e7.2.2 The Normal Model 172\u003c\/p\u003e \u003cp\u003e7.3 Trading Off Tightness and Tardiness 174\u003c\/p\u003e \u003cp\u003e7.3.1 An Objective Function for the Trade-off 174\u003c\/p\u003e \u003cp\u003e7.3.2 The Normal Model 175\u003c\/p\u003e \u003cp\u003e7.3.3 A Branch-and-bound Solution 178\u003c\/p\u003e \u003cp\u003e7.4 The Stochastic E\/T Problem 184\u003c\/p\u003e \u003cp\u003e7.5 Using the Lognormal Distribution 190\u003c\/p\u003e \u003cp\u003e7.6 Setting Release Dates 194\u003c\/p\u003e \u003cp\u003e7.7 The Stochastic U-problem: A Service-level Approach 197\u003c\/p\u003e \u003cp\u003e7.8 The Stochastic U-problem: An Economic Approach 204\u003c\/p\u003e \u003cp\u003e7.9 Summary 208\u003c\/p\u003e \u003cp\u003eExercises 210\u003c\/p\u003e \u003cp\u003eBibliography 213\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Extensions of the Basic Model 215\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Introduction 215\u003c\/p\u003e \u003cp\u003e8.2 Nonsimultaneous Arrivals 216\u003c\/p\u003e \u003cp\u003e8.2.1 Minimizing the Makespan 219\u003c\/p\u003e \u003cp\u003e8.2.2 Minimizing Maximum Tardiness 221\u003c\/p\u003e \u003cp\u003e8.2.3 Other Measures of Performance 223\u003c\/p\u003e \u003cp\u003e8.3 Related Jobs 225\u003c\/p\u003e \u003cp\u003e8.3.1 Minimizing Maximum Tardiness 226\u003c\/p\u003e \u003cp\u003e8.3.2 Minimizing Total Flowtime with Strings 226\u003c\/p\u003e \u003cp\u003e8.3.3 Minimizing Total Flowtime with Parallel Chains 229\u003c\/p\u003e \u003cp\u003e8.4 Sequence-Dependent Setup Times 232\u003c\/p\u003e \u003cp\u003e8.4.1 Dynamic Programming Solutions 234\u003c\/p\u003e \u003cp\u003e8.4.2 Branch-And-Bound Solutions 235\u003c\/p\u003e \u003cp\u003e8.4.3 Heuristic Solutions 240\u003c\/p\u003e \u003cp\u003e8.5 Stochastic Traveling Salesperson Models 242\u003c\/p\u003e \u003cp\u003e8.6 Summary 247\u003c\/p\u003e \u003cp\u003eExercises 248\u003c\/p\u003e \u003cp\u003eBibliography 251\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Parallel-machine Models 255\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Introduction 255\u003c\/p\u003e \u003cp\u003e9.2 Minimizing the Makespan 255\u003c\/p\u003e \u003cp\u003e9.2.1 Nonpreemptable Jobs 257\u003c\/p\u003e \u003cp\u003e9.2.2 Nonpreemptable Related Jobs 263\u003c\/p\u003e \u003cp\u003e9.2.3 Preemptable Jobs 267\u003c\/p\u003e \u003cp\u003e9.3 Minimizing Total Flowtime 268\u003c\/p\u003e \u003cp\u003e9.4 Stochastic Models 274\u003c\/p\u003e \u003cp\u003e9.4.1 The Makespan Problem with Exponential Processing Times 274\u003c\/p\u003e \u003cp\u003e9.4.2 Safe Scheduling with Parallel Machines 276\u003c\/p\u003e \u003cp\u003e9.5 Summary 277\u003c\/p\u003e \u003cp\u003eExercises 279\u003c\/p\u003e \u003cp\u003eBibliography 280\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Flow Shop Scheduling 283\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Introduction 283\u003c\/p\u003e \u003cp\u003e10.2 Permutation Schedules 286\u003c\/p\u003e \u003cp\u003e10.3 The Two-machine Problem 288\u003c\/p\u003e \u003cp\u003e10.3.1 Johnson’s Rule 288\u003c\/p\u003e \u003cp\u003e10.3.2 A Proof of Johnson’s Rule 290\u003c\/p\u003e \u003cp\u003e10.3.3 The Model with Time Lags 293\u003c\/p\u003e \u003cp\u003e10.3.4 The Model with Setups 294\u003c\/p\u003e \u003cp\u003e10.4 Special Cases of the Three-machine Problem 294\u003c\/p\u003e \u003cp\u003e10.5 Minimizing the Makespan 296\u003c\/p\u003e \u003cp\u003e10.5.1 Branch-and-Bound Solutions 297\u003c\/p\u003e \u003cp\u003e10.5.2 Integer Programming Solutions 300\u003c\/p\u003e \u003cp\u003e10.5.3 Heuristic Solutions 306\u003c\/p\u003e \u003cp\u003e10.6 Variations of the m-Machine Model 308\u003c\/p\u003e \u003cp\u003e10.6.1 Ordered Flow Shops 308\u003c\/p\u003e \u003cp\u003e10.6.2 Flow Shops with Blocking 309\u003c\/p\u003e \u003cp\u003e10.6.3 No-Wait Flow Shops 310\u003c\/p\u003e \u003cp\u003e10.7 Summary 313\u003c\/p\u003e \u003cp\u003eExercises 313\u003c\/p\u003e \u003cp\u003eBibliography 315\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11 Stochastic Flow Shop Scheduling 319\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1 Introduction 319\u003c\/p\u003e \u003cp\u003e11.2 Stochastic Counterpart Models 320\u003c\/p\u003e \u003cp\u003e11.3 Safe Scheduling Models with Stochastic Independence 327\u003c\/p\u003e \u003cp\u003e11.4 Flow Shops with Linear Association 330\u003c\/p\u003e \u003cp\u003e11.5 Empirical Observations 331\u003c\/p\u003e \u003cp\u003e11.6 Summary 336\u003c\/p\u003e \u003cp\u003eExercises 337\u003c\/p\u003e \u003cp\u003eBibliography 339\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12 Lot Streaming Procedures for the Flow Shop 341\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1 Introduction 341\u003c\/p\u003e \u003cp\u003e12.2 The Basic Two-machine Model 342\u003c\/p\u003e \u003cp\u003e12.2.1 Preliminaries 342\u003c\/p\u003e \u003cp\u003e12.2.2 The Continuous Version 345\u003c\/p\u003e \u003cp\u003e12.2.3 The Discrete Version 348\u003c\/p\u003e \u003cp\u003e12.2.4 Models with Setups 350\u003c\/p\u003e \u003cp\u003e12.3 The Three-machine Model with Consistent Sublots 352\u003c\/p\u003e \u003cp\u003e12.3.1 The Continuous Version 352\u003c\/p\u003e \u003cp\u003e12.3.2 The Discrete Version 355\u003c\/p\u003e \u003cp\u003e12.4 The Three-machine Model with Variable Sublots 355\u003c\/p\u003e \u003cp\u003e12.4.1 Item and Batch Availability 355\u003c\/p\u003e \u003cp\u003e12.4.2 The Continuous Version 357\u003c\/p\u003e \u003cp\u003e12.4.3 The Discrete Version 359\u003c\/p\u003e \u003cp\u003e12.4.4 Computational Experiments 360\u003c\/p\u003e \u003cp\u003e12.5 The Fundamental Partition 363\u003c\/p\u003e \u003cp\u003e12.5.1 Defining the Fundamental Partition 364\u003c\/p\u003e \u003cp\u003e12.5.2 A Heuristic Procedure for s Sublots 367\u003c\/p\u003e \u003cp\u003e12.6 Summary 367\u003c\/p\u003e \u003cp\u003eExercises 369\u003c\/p\u003e \u003cp\u003eBibliography 371\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13 Scheduling Groups of Jobs 373\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1 Introduction 373\u003c\/p\u003e \u003cp\u003e13.2 Scheduling Job Families 374\u003c\/p\u003e \u003cp\u003e13.2.1 Minimizing Total Weighted Flowtime 375\u003c\/p\u003e \u003cp\u003e13.2.2 Minimizing Maximum Lateness 377\u003c\/p\u003e \u003cp\u003e13.2.3 Minimizing Makespan in the Two-Machine Flow Shop 379\u003c\/p\u003e \u003cp\u003e13.3 Scheduling with Batch Availability 383\u003c\/p\u003e \u003cp\u003e13.4 Scheduling with a Batch Processor 387\u003c\/p\u003e \u003cp\u003e13.4.1 Minimizing the Makespan with Dynamic Arrivals 387\u003c\/p\u003e \u003cp\u003e13.4.2 Minimizing Makespan in the Two-Machine Flow Shop 389\u003c\/p\u003e \u003cp\u003e13.4.3 Minimizing Total Flowtime with Dynamic Arrivals 390\u003c\/p\u003e \u003cp\u003e13.4.4 Batch-Dependent Processing Times 392\u003c\/p\u003e \u003cp\u003e13.5 Summary 394\u003c\/p\u003e \u003cp\u003eExercises 395\u003c\/p\u003e \u003cp\u003eBibliography 397\u003c\/p\u003e \u003cp\u003e\u003cb\u003e14 The Job Shop Problem 399\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e14.1 Introduction 399\u003c\/p\u003e \u003cp\u003e14.2 Types of Schedules 402\u003c\/p\u003e \u003cp\u003e14.3 Schedule Generation 407\u003c\/p\u003e \u003cp\u003e14.4 The Shifting Bottleneck Procedure 412\u003c\/p\u003e \u003cp\u003e14.4.1 Bottleneck Machines 412\u003c\/p\u003e \u003cp\u003e14.4.2 Heuristic and Optimal Solutions 414\u003c\/p\u003e \u003cp\u003e14.5 Neighborhood Search Heuristics 417\u003c\/p\u003e \u003cp\u003e14.6 Summary 421\u003c\/p\u003e \u003cp\u003eExercises 422\u003c\/p\u003e \u003cp\u003eBibliography 424\u003c\/p\u003e \u003cp\u003e\u003cb\u003e15 Simulation Models for the Dynamic Job Shop 427\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e15.1 Introduction 427\u003c\/p\u003e \u003cp\u003e15.2 Model Elements 428\u003c\/p\u003e \u003cp\u003e15.3 Types of Dispatching Rules 430\u003c\/p\u003e \u003cp\u003e15.4 Reducing Mean Flowtime 432\u003c\/p\u003e \u003cp\u003e15.5 Meeting Due Dates 436\u003c\/p\u003e \u003cp\u003e15.5.1 Background 436\u003c\/p\u003e \u003cp\u003e15.5.2 Some Clarifying Experiments 441\u003c\/p\u003e \u003cp\u003e15.5.3 Experimental Results 443\u003c\/p\u003e \u003cp\u003e15.6 Summary 449\u003c\/p\u003e \u003cp\u003eBibliography 451\u003c\/p\u003e \u003cp\u003e\u003cb\u003e16 Network Methods for Project Scheduling 453\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e16.1 Introduction 453\u003c\/p\u003e \u003cp\u003e16.2 Logical Constraints And Network Construction 454\u003c\/p\u003e \u003cp\u003e16.3 Temporal Analysis of Networks 458\u003c\/p\u003e \u003cp\u003e16.4 The Time\/Cost Trade-off 463\u003c\/p\u003e \u003cp\u003e16.5 Traditional Probabilistic Network Analysis 467\u003c\/p\u003e \u003cp\u003e16.5.1 The PERT Method 467\u003c\/p\u003e \u003cp\u003e16.5.2 Theoretical Limitations of PERT 472\u003c\/p\u003e \u003cp\u003e16.6 Summary 476\u003c\/p\u003e \u003cp\u003eExercises 478\u003c\/p\u003e \u003cp\u003eBibliography 481\u003c\/p\u003e \u003cp\u003e\u003cb\u003e17 Resource-Constrained Project Scheduling 483\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e17.1 Introduction 483\u003c\/p\u003e \u003cp\u003e17.2 Extending the Job Shop Model 484\u003c\/p\u003e \u003cp\u003e17.3 Extending the Project Model 490\u003c\/p\u003e \u003cp\u003e17.4 Heuristic Construction and Search Algorithms 493\u003c\/p\u003e \u003cp\u003e17.4.1 Construction Heuristics 493\u003c\/p\u003e \u003cp\u003e17.4.2 Neighborhood Search Improvement Schemes 496\u003c\/p\u003e \u003cp\u003e17.4.3 Selecting Priority Lists 499\u003c\/p\u003e \u003cp\u003e17.5 Stochastic Sequencing with Limited Resources 501\u003c\/p\u003e \u003cp\u003e17.6 Summary 503\u003c\/p\u003e \u003cp\u003eExercises 505\u003c\/p\u003e \u003cp\u003eBibliography 508\u003c\/p\u003e \u003cp\u003e\u003cb\u003e18 Project Analytics 511\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e18.1 Introduction 511\u003c\/p\u003e \u003cp\u003e18.2 Basic Partitioning 513\u003c\/p\u003e \u003cp\u003e18.3 Correcting for Rounding 515\u003c\/p\u003e \u003cp\u003e18.4 Accounting for the Parkinson Effect 516\u003c\/p\u003e \u003cp\u003e18.5 Identifying Mixtures 521\u003c\/p\u003e \u003cp\u003e18.6 Addressing Subjective Estimation Bias 524\u003c\/p\u003e \u003cp\u003e18.7 Linear Association 526\u003c\/p\u003e \u003cp\u003e18.7.1 Systemic Bias 526\u003c\/p\u003e \u003cp\u003e18.7.2 Cross-Validation 530\u003c\/p\u003e \u003cp\u003e18.7.3 Using Nonparametric Bootstrap Sampling 531\u003c\/p\u003e \u003cp\u003e18.8 Summary 534\u003c\/p\u003e \u003cp\u003eBibliography 536\u003c\/p\u003e \u003cp\u003e\u003cb\u003e19 PERT 21: Analytics-Based Safe Project Scheduling 537\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e19.1 Introduction 537\u003c\/p\u003e \u003cp\u003e19.2 Stochastic Balance Principles for Activity Networks 539\u003c\/p\u003e \u003cp\u003e19.2.1 The Assembly Coordination Model 540\u003c\/p\u003e \u003cp\u003e19.2.2 Balancing a General Project Network 547\u003c\/p\u003e \u003cp\u003e19.2.3 Additional Examples 550\u003c\/p\u003e \u003cp\u003e19.3 Hierarchical Balancing and Progress Payments 557\u003c\/p\u003e \u003cp\u003e19.4 Crashing Stochastic Activities 560\u003c\/p\u003e \u003cp\u003e19.5 Summary 565\u003c\/p\u003e \u003cp\u003eExercises 567\u003c\/p\u003e \u003cp\u003eBibliography 569\u003c\/p\u003e \u003cp\u003eAppendix A: Practical Processing Time Distributions 571\u003c\/p\u003e \u003cp\u003eAppendix B: The Critical Ratio Rule 597\u003c\/p\u003e \u003cp\u003eIndex 613\u003c\/p\u003e  \u003cp\u003e\u003cb\u003eKENNETH R. BAKER, P\u003csmall\u003eH\u003c\/small\u003eD,\u003c\/b\u003e is Nathaniel Leverone Professor of Management at the Tuck School of Business and INFORMS Fellow. He is a Founding Associate Editor for the International Journal of Planning and Scheduling. \u003c\/p\u003e\u003cp\u003e\u003cb\u003eDAN TRIETSCH, P\u003csmall\u003eH\u003c\/small\u003eD,\u003c\/b\u003e is an independent researcher and consultant in scheduling and project analytics, with extensive teaching experience, mostly at the graduate level. He is an Area Editor for the International Journal of Information Technology Project Management and a Board Member of the International Journal of Planning and Scheduling.   \u003c\/p\u003e\u003cp\u003e\u003cb\u003eAn updated edition of the text that explores the core topics in scheduling theory\u003c\/b\u003e \u003c\/p\u003e\u003cp\u003eThe 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. \u003c\/p\u003e\u003cp\u003eThis 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: \u003c\/p\u003e\u003cul\u003e \u003cli\u003eOffers comprehensive coverage of deterministic models as well as recent approaches and developments for stochastic models\u003c\/li\u003e \u003cli\u003eEmphasizes the application of generic optimization software to basic sequencing problems and the use of spreadsheet-based optimization methods\u003c\/li\u003e \u003cli\u003eIncludes updated coverage on safe scheduling, lognormal modeling, and job selection\u003c\/li\u003e \u003cli\u003eProvides basic coverage of robust scheduling as contrasted with safe scheduling\u003c\/li\u003e \u003cli\u003eAdds a new chapter on project analytics, which supports the PERT21 framework for project scheduling in a stochastic environment.\u003c\/li\u003e \u003cli\u003eExtends the coverage of PERT 21 to include hierarchical scheduling\u003c\/li\u003e \u003cli\u003eProvides end-of-chapter references and access to advanced Research Notes, to aid readers in the further exploration of advanced topics\u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eWritten 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.\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":47989854503141,"sku":"NP9781119262565","price":134.95,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9781119262565.jpg?v=1761785684","url":"https:\/\/k12savings.com\/products\/principles-of-sequencing-and-scheduling-isbn-9781119262565","provider":"K12savings","version":"1.0","type":"link"}