Train the students in recognizing machine scheduling problems, classify them in terms of computational complexity and solve them by heuristic, approximation or exact algorithms.
LEARNING OUTCOMES
On successful completion of this course, the student should:
Elements of a (deterministic) scheduling problem, examples of practical applications
Classification of scheduling problems
Integer Linear Programming formulations
Single machine scheduling: computational complexity, heuristic and exact algoritms
Parallel machine scheduling: exact, heuristic and approximation algorithms
Relationships with basic Combinatorial Optimization problems
Optimization problems in Project Scheduling
Job Shop scheduling: formulations, heuristic and exact algorithms
Basic elements of computational complexity, linear programming and network flows
Michael Pinedo, Scheduling Theory, Algorithms, and Systems. Prentice Hall