Principles of Sequencing and Scheduling

by Baker, Kenneth R.; Trietsch, Dan

ISBN13: 9780470391655

ISBN10: 0470391650

Format: Hardcover

Pub. Date: 2009-04-13

Publisher(s): Wiley

Other versions by this Author

List Price: ~~$149.00~~

Buy New

Usually Ships in 3-4 Business Days

$148.85

Add to Cart

Rent Textbook

Select for Price

Add to Cart

There was a problem. Please try again later.

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Buy from our Marketplace starting at $124.62

Summary

Sequencing and scheduling rely heavily on decision making and can have a major impact on the productivity of a process. Written by two well-known experts in the field, Principles of Sequencing and Scheduling thoroughly discusses the fundamental and core topics of scheduling theory. An expanded, updated, and more comprehensive version of Kenneth Baker's two previous works, this accessible text thoroughly covers deterministic models and includes recent developments and approaches of stochastic models. This is an ideal reference for practicing applied mathematicians, statisticians, computer scientists, operations researchers, and industrial engineers.

Author Biography

Kenneth R. Baker, PhD, is Nathaniel Leverone Professor of Management at Dartmouth College. A Fellow of the Institute for Operations Research and the Management Sciences (INFORMS), Dr. Baker has published extensively in his areas of research interest, which include mathematical modeling, spreadsheet engineering, and scheduling. He is the coauthor of Management Science: The Art of Modeling with Spreadsheets, Second Edition, also published by Wiley. Dan Trietsch, PhD, is Professor of Industrial Engineering at the American University of Armenia. He has authored over thirty journal articles on topics such as network design, statistical quality control, and various aspects of scheduling.

Preface	p. xiii
Introduction	p. 1
Introduction to Sequencing and Scheduling	p. 1
Scheduling Theory	p. 3
Philosophy and Coverage of the Book	p. 6
References	p. 8
Single-Machine Sequencing	p. 10
Introduction	p. 10
Preliminaries	p. 11
Problems Without Due Dates: Elementary Results	p. 15
Flowtime and Inventory	p. 15
Minimizing Total Flowtime	p. 16
Minimizing Total Weighted Flowtime	p. 19
Problems with Due Dates: Elementary Results	p. 21
Lateness Criteria	p. 21
Minimizing the Number of Tardy Jobs	p. 24
Minimizing Total Tardiness	p. 25
Due Dates as Decisions	p. 29
Summary	p. 31
References	p. 31
Exercises	p. 32
Optimization Methods for the Single-Machine Problem	p. 34
Introduction	p. 34
Adjacent Pairwise Interchange Methods	p. 36
A Dynamic Programming Approach	p. 37
Dominance Properties	p. 43
A Branch and Bound Approach	p. 47
Summary	p. 53
References	p. 55
Exercises	p. 55
Heuristic Methods for the Single-Machine Problem	p. 57
Introduction	p. 57
Dispatching and Construction Procedures	p. 58
Random Sampling	p. 63
Neighborhood Search Techniques	p. 66
Tabu Search	p. 70
Simulated Annealing	p. 72
Genetic Algorithms	p. 74
The Evolutionary Solver	p. 75
Summary	p. 79
References	p. 81
Exercises	p. 81
Earliness and Tardiness Costs	p. 86
Introduction	p. 86
Minimizing Deviations from a Common Due Date	p. 88
Four Basic Results	p. 88
Due Dates as Decisions	p. 93
The Restricted Version	p. 94
Asymmetric Earliness and Tardiness Costs	p. 96
Quadratic Costs	p. 99
Job-Dependent Costs	p. 100
Distinct Due Dates	p. 101
Summary	p. 104
References	p. 105
Exercises	p. 105
Sequencing for Stochastic Scheduling	p. 108
Introduction	p. 108
Basic Stochastic Counterpart Models	p. 109
The Deterministic Counterpart	p. 115
Minimizing the Maximum Cost	p. 117
The Jensen Gap	p. 122
Stochastic Dominance and Association	p. 123
Using Risk Solver	p. 127
Summary	p. 132
References	p. 134
Exercises	p. 134
Safe Scheduling	p. 137
Introduction	p. 137
Meeting Service-Level Targets	p. 138
Trading Off Tightness and Tardiness	p. 141
The Stochastic E/T Problem	p. 145
Setting Release Dates	p. 149
The Stochastic U-Problem: A Service-Level Approach	p. 152
The Stochastic U-Problem: An Economic Approach	p. 156
Summary	p. 160
References	p. 161
Exercises	p. 162
Extensions of the Basic Model	p. 165
Introduction	p. 165
Nonsimultaneous Arrivals	p. 166
Minimizing the Makespan	p. 169
Minimizing Maximum Tardiness	p. 171
Other Measures of Performance	p. 172
Related Jobs	p. 174
Minimizing Maximum Tardiness	p. 175
Minimizing Total Flowtime with Strings	p. 176
Minimizing Total Flowtime with Parallel Chains	p. 178
Sequence-Dependent Setup Times	p. 181
Dynamic Programming Solutions	p. 183
Branch and Bound Solutions	p. 184
Heuristic Solutions	p. 189
Stochastic Models with Sequence-Dependent Setup Times	p. 190
Setting Tight Due Dates	p. 191
Revisiting the Tightness/Tardiness Trade-off	p. 192
Summary	p. 195
References	p. 196
Exercises	p. 197
Parallel-Machine Models	p. 200
Introduction	p. 200
Minimizing the Makespan	p. 201
Nonpreemptable Jobs	p. 202
Nonpreemptable Related Jobs	p. 208
Preemptable Jobs	p. 211
Minimizing Total Flowtime	p. 213
Stochastic Models	p. 217
The Makespan Problem with Exponential Processing Times	p. 218
Safe Scheduling with Parallel Machines	p. 220
Summary	p. 221
References	p. 222
Exercises	p. 223
Flow Shop Scheduling	p. 225
Introduction	p. 225
Permutation Schedules	p. 228
The Two-Machine Problem	p. 230
Johnson's Rule	p. 230
A Proof of Johnson's Rule	p. 232
The Model with Time Lags	p. 234
The Model with Setups	p. 235
Special Cases of The Three-Machine Problem	p. 236
Minimizing the Makespan	p. 237
Branch and Bound Solutions	p. 238
Heuristic Solutions	p. 241
Variations of the m-Machine Model	p. 243
Ordered Flow Shops	p. 243
Flow Shops with Blocking	p. 244
No-Wait Flow Shops	p. 245
Summary	p. 247
References	p. 248
Exercises	p. 249
Stochastic Flow Shop Scheduling	p. 251
Introduction	p. 251
Stochastic Counterpart Models	p. 252
Safe Scheduling Models with Stochastic Independence	p. 258
Flow Shops with Linear Association	p. 261
Empirical Observations	p. 262
Summary	p. 267
References	p. 268
Exercises	p. 269
Lot Streaming Procedures for the Flow Shop	p. 271
Introduction	p. 271
The Basic Two-Machine Model	p. 273
Preliminaries	p. 273
The Continuous Version	p. 274
The Discrete Version	p. 277
Models with Setups	p. 279
The Three-Machine Model with Consistent Sublots	p. 281
The Continuous Version	p. 281
The Discrete Version	p. 284
The Three-Machine Model with Variable Sublots	p. 285
Item and Batch Availability	p. 285
The Continuous Version	p. 285
The Discrete Version	p. 287
Computational Experiments	p. 290
The Fundamental Partition	p. 292
Defining the Fundamental Partition	p. 292
A Heuristic Procedure for s Sublots	p. 295
Summary	p. 295
References	p. 297
Exercises	p. 298
Scheduling Groups of Jobs	p. 300
Introduction	p. 300
Scheduling Job Families	p. 301
Minimizing Total Weighted Flowtime	p. 302
Minimizing Maximum Lateness	p. 304
Minimizing Makespan in the Two-Machine Flow Shop	p. 306
Scheduling with Batch Availability	p. 309
Scheduling with a Batch Processor	p. 313
Minimizing the Makespan with Dynamic Arrivals	p. 314
Minimizing Makespan in the Two-Machine Flow Shop	p. 315
Minimizing Total Flowtime with Dynamic Arrivals	p. 317
Batch-Dependent Processing Times	p. 318
Summary	p. 320
References	p. 321
Exercises	p. 322
The Job Shop Problem	p. 325
Introduction	p. 325
Types of Schedules	p. 328
Schedule Generation	p. 333
The Shifting Bottleneck Procedure	p. 337
Bottleneck Machines	p. 338
Heuristic and Optimal Solutions	p. 339
Neighborhood Search Heuristics	p. 342
Summary	p. 345
References	p. 346
Exercises	p. 347
Simulation Models for the Dynamic Job Shop	p. 349
Introduction	p. 349
Model Elements	p. 350
Types of Dispatching Rules	p. 352
Reducing Mean Flowtime	p. 354
Meeting Due Dates	p. 357
Background	p. 357
Some Clarifying Experiments	p. 362
Experimental Results	p. 364
Summary	p. 369
References	p. 370
Network Methods for Project Scheduling	p. 372
Introduction	p. 372
Logical Constraints and Network Construction	p. 373
Temporal Analysis of Networks	p. 376
The Time/Cost Trade-off	p. 381
Traditional Probabilistic Network Analysis	p. 385
The PERT Method	p. 385
Theoretical Limitations of PERT	p. 389
Summary	p. 393
References	p. 394
Exercises	p. 395
Resource-Constrained Project Scheduling	p. 398
Introduction	p. 398
Extending the Job Shop Model	p. 399
Extending the Project Model	p. 405
Heuristic Construction and Search Algorithms	p. 407
Construction Heuristics	p. 408
Neighborhood Search Improvement Schemes	p. 410
Selecting Priority Lists	p. 412
Summary	p. 414
References	p. 415
Exercises	p. 415
Safe Scheduling for Projects	p. 418
Introduction	p. 418
Stochastic Balance Principles For Activity Networks	p. 420
The Assembly Coordination Model	p. 420
Balancing a General Project Network	p. 426
Additional Examples	p. 428
Hierarchical Balancing	p. 434
Crashing Stochastic Activities	p. 436
Summary	p. 439
References	p. 441
Exercises	p. 441
Practical Processing Time Distributions	p. 445
Important Processing Time Distributions	p. 445
The Uniform Distribution	p. 445
The Exponential Distribution	p. 446
The Normal Distribution	p. 447
The Lognormal Distribution	p. 447
The Parkinson Distribution	p. 449
Increasing and Decreasing Completion Rates	p. 450
Stochastic Dominance	p. 451
Linearly Associated Processing Times	p. 452
References	p. 458
The Critical Ratio Rule	p. 459
A Basic Trade-off Problem	p. 459
Optimal Policy for Discrete Probability Models	p. 461
A Special Discrete Case: Equally Likely Outcomes	p. 463
Optimal Policy for Continuous Probability Models	p. 463
A Special Continuous Case: The Normal Distribution	p. 467
Calculating d + yE(T) for the Normal Distribution	p. 469
References	p. 470
Integer Programming Models for Sequencing	p. 471
Introduction	p. 471
The Single-Machine Model	p. 472
Sequence-Position Decisions	p. 472
Precedence Decisions	p. 473
Time-Indexed Decisions	p. 473
The Flow Shop Model	p. 475
References	p. 477
Name Index	p. 479
Subject Index	p. 483
Table of Contents provided by Ingram. All Rights Reserved.

Kids

Men

Unisex

Women

For You

For Your Car

For Your Home

For Your Pet

For Your Tech

Holiday

Home Decor

Mascot

Office Decor

Spirit

Stationary

Diploma Frames

Graduation Gear

Graduation Gifts

For Your Office

Clothing

Principles of Sequencing and Scheduling

Buy New

Rent Textbook

Used Textbook

eTextbook

Summary

Author Biography

Table of Contents

Principles of Sequencing and Scheduling

Buy New

Rent Textbook

Used Textbook

eTextbook

How Marketplace Works:

Summary

Author Biography

Table of Contents

Digital License