Principles of sequencing and scheduling
An up-to-date and comprehensive treatment of the fundamentals of scheduling theory, including recent advances and state-of-the-art topics Principles of Sequencing and Scheduling strikes a unique balance between theory and practice, providing an accessible introduction to the concepts, methods, and r...
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Hoboken, N.J. :
John Wiley
2009.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009664727806719 |
Tabla de Contenidos:
- PRINCIPLES OF SEQUENCING AND SCHEDULING; CONTENTS; Preface; Acknowledgments; 1 Introduction; 1.1 Introduction to Sequencing and Scheduling; 1.2 Scheduling Theory; 1.3 Philosophy and Coverage of the Book; References; 2 Single-Machine Sequencing; 2.1 Introduction; 2.2 Preliminaries; 2.3 Problems Without Due Dates: Elementary Results; 2.3.1 Flowtime and Inventory; 2.3.2 Minimizing Total Flowtime; 2.3.3 Minimizing Total Weighted Flowtime; 2.4 Problems with Due Dates: Elementary Results; 2.4.1 Lateness Criteria; 2.4.2 Minimizing the Number of Tardy Jobs; 2.4.3 Minimizing Total Tardiness
- 2.4.4 Due Dates as Decisions2.5 Summary; References; Exercises; 3 Optimization Methods for the Single-Machine Problem; 3.1 Introduction; 3.2 Adjacent Pairwise Interchange Methods; 3.3 A Dynamic Programming Approach; 3.4 Dominance Properties; 3.5 A Branch and Bound Approach; 3.6 Summary; References; Exercises; 4 Heuristic Methods for the Single-Machine Problem; 4.1 Introduction; 4.2 Dispatching and Construction Procedures; 4.3 Random Sampling; 4.4 Neighborhood Search Techniques; 4.5 Tabu Search; 4.6 Simulated Annealing; 4.7 Genetic Algorithms; 4.8 The Evolutionary Solver; 4.9 Summary
- ReferencesExercises; 5 Earliness and Tardiness Costs; 5.1 Introduction; 5.2 Minimizing Deviations from a Common Due Date; 5.2.1 Four Basic Results; 5.2.2 Due Dates as Decisions; 5.3 The Restricted Version; 5.4 Asymmetric Earliness and Tardiness Costs; 5.5 Quadratic Costs; 5.6 Job-Dependent Costs; 5.7 Distinct Due Dates; 5.8 Summary; References; Exercises; 6 Sequencing for Stochastic Scheduling; 6.1 Introduction; 6.2 Basic Stochastic Counterpart Models; 6.3 The Deterministic Counterpart; 6.4 Minimizing the Maximum Cost; 6.5 The Jensen Gap; 6.6 Stochastic Dominance and Association
- 6.7 Using Risk Solver6.8 Summary; References; Exercises; 7 Safe Scheduling; 7.1 Introduction; 7.2 Meeting Service-Level Targets; 7.3 Trading Off Tightness and Tardiness; 7.4 The Stochastic E/T Problem; 7.5 Setting Release Dates; 7.6 The Stochastic U-Problem: A Service-Level Approach; 7.7 The Stochastic U-Problem: An Economic Approach; 7.8 Summary; References; Exercises; 8 Extensions of the Basic Model; 8.1 Introduction; 8.2 Nonsimultaneous Arrivals; 8.2.1 Minimizing the Makespan; 8.2.2 Minimizing Maximum Tardiness; 8.2.3 Other Measures of Performance; 8.3 Related Jobs
- 8.3.1 Minimizing Maximum Tardiness8.3.2 Minimizing Total Flowtime with Strings; 8.3.3 Minimizing Total Flowtime with Parallel Chains; 8.4 Sequence-Dependent Setup Times; 8.4.1 Dynamic Programming Solutions; 8.4.2 Branch and Bound Solutions; 8.4.3 Heuristic Solutions; 8.5 Stochastic Models with Sequence-Dependent Setup Times; 8.5.1 Setting Tight Due Dates; 8.5.2 Revisiting the Tightness/Tardiness Trade-off; 8.6 Summary; References; Exercises; 9 Parallel-Machine Models; 9.1 Introduction; 9.2 Minimizing the Makespan; 9.2.1 Nonpreemptable Jobs; 9.2.2 Nonpreemptable Related Jobs
- 9.2.3 Preemptable Jobs
