Publication year: 2006
Internet Resource: Please Login to download book
This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into discrete optimization (covering complexity, shortest path algorithms, linear programming, network ?ow algorithms and general optimization methods). In the second part (Chapter 3) resource-constrained project scheduling problems are considered. Especially, methods like constraint propagation, branch-a- bound algorithms and heuristic procedures are described. Furthermore, lower bounds and general objective functions are discussed.
Subject: Business and Economics, Discrete Optimization, Job-Shop Problems, Optimization Methods, Project Planning, Scheduling, algorithm, algorithms, complexity, genetic algorithms, optimization, programming