Home Search AAA
COURSE MENU
 
MAIN MENU
 
 
SCHEDULING  ALGORITHMS
Code: 11486
ECTS: 6
Lecturers in charge: izv. prof. dr. sc. Domagoj Jakobović
English level:

1,0,0

All teaching activities will be held in Croatian. However, foreign students in mixed groups will have the opportunity to attend additional office hours with the lecturer and teaching assistants in English to help master the course materials. Additionally, the lecturer will refer foreign students to the corresponding literature in English, as well as give them the possibility of taking the associated exams in English.
Description:
Algorithm time complexity. NP-complete and NP-hard problems. Fundamental scheduling algorithms with goals to minimize makespan, maximum tardiness, total tardiness and number of late jobs. The traditional scheduling problems: parallel uniform machines, parallel unrelated machines, flow shop, job shop, open shop, etc. Stochastic optimization algorithms for scheduling.
Literature:
  1. J. Y-T. Leung (ed.): 'Handbook of Scheduling: Algorithms, Models and Performance Analysis', Chapman & Hall/CRC, Computer and Information Science Series, 2004.
  2. A. Kusiak (ed): 'Flexible Manufacturing Systems: Methods and Studies', Vol. 12 of Studies in Management Science and Systems Series, North-Holland, 1986.
  3. M. Pinedo: 'Scheduling: Theory, Algorithms, and Systems', Prentice Hall, 2008.
  4. J. W. S. Liu: 'Real-Time Systems', Prentice Hall, 2000.
Consultations schedule:
NEWS
FORUM
Sort by: title | last reply time | thread opened time
Title Replies Last reply
FREQUENTLY ASKED QUESTIONS
REPOSITORY
 
Repository is empty
REPOSITORY
 
Repository is empty
POLL
 
No polls currently selected on this page!