Subject: Subject Sylbus: Algorithms in Scheduling - 096326

Algorithms in Scheduling - 096326
Will not be given the year
Credit
Points
3.5
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
3 1     4

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: Operation of Production Service Systems 094142
or Data Structures and Algorithms 094223
or Algorithms 1 234247


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.




Textbooks
PublishedPublisherAuthorsBook
1974wileyk.r. bakerintroduction to segmencing and scheduling
1982ellis horwoods. frenchsegmencing and scheduling

Created in 08/03/2021 Time 14:33:20