Course Learning Outcomes
- Scheduling theory and problem classification
- Single processor problems
- Parallel processor problems
- Flowshop problems
- Jobshop problems
- Special scheduling problems
- Dynamic programming applied to scheduling problems
- Branch and bound method applied to scheduling problems
- Heuristic methods
- Apply activity based costing to increase accuracy in cost allocation.
- Develop mathematical models and solve them using mathematical programming software