CHAPTER 9
Sequencing and Scheduling: Algorithms and Complexity
E.L. Lawler, LK. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys
Part I. Preliminaries
1. Sequencing and scheduling problems*
2. Algorithms and complexity
3. A class of deterministic machine scheduling problems
Part II. The single machine
4. Minmax criteria
5. Total weighted completion time
6. Weighted number of late jobs
7. Total tardiness and beyond
Part III. Parallel machines
8. Minsum criteria
9. Minmax criteria without preemption
10. Minmax criteria with preemption
11. Precedence constraints
Part IV Multi-operation models
12. Open shops
13. Flow shops
14. Job shops
Part V. More sequencing and scheduling
15. Resource-constrained project scheduling
16. Stochastic machine scheduling
* The first two pages of the chapters are available as PDF file.