Topics# Regular and Irregular Measures. Single Machine, Parallel Machines and Sequential Machines. (flow-shop, Job-shop). Computational Complexity (np-hard, Np-complete) and Its Influence On Computer Based Solutions. Methods For Dealing With Np-hard Problems Such As Branch And Bound, Heuristic and Metaheuristic Algorithms, Pseudo-polynomial Algorithms and Approximations. Due-date Assignment.

Faculty: Data and Decision Sciences
|Undergraduate Studies |Graduate Studies
Pre-required courses

94142 - Operation of Production Service Systems or 94223 - מבני נתונים ואלגוריתמים or 234247 - Algorithms 1