ISE 448
Sequencing and Scheduling (3-0-3)
Scheduling problems, optimality of schedules,
processing, basic single; machine results, precedence constraints and
efficiency, constructive algorithms for flow-shops and job-shops, dynamic
programming approaches, branch and bound methods, integer, programming
formulations, hard problems and NP-completeness. Heuristic methods: general
approaches and worst-case bounds, simulated annealing approach.
Prerequisite: ISE 303
Notes & Slides :
Old Exams and Quizez :
Books :
Online Courses :
Videos :
ليست هناك تعليقات:
إرسال تعليق