DM204: Scheduling, Timetabling and Routing (5 ECTS)

STADS: 15008301

Level
PhD course

Teaching period
The course is offered when needed.

Teacher responsible
No responsible teachers found, contact the department if necessary

Timetable
Group Type Day Time Classroom Weeks Comment
Common I Wednesday 10-12 IMADA Seminarrum 36-41
Common I Thursday 10-12 IMADA Seminarrum 36-41
Common I Friday 12-14 IMADA Seminarrum 36-41
Show entire timetable
Show personal time table for this course.

Comment:
Underviser: Niels H. Kjeldsen.

Prerequisites:
None

Academic preconditions:
The Bachelor’s degree has to be passed. The contents of DM545 Integer and Linear Programming and DM811 Heuristics and Local Search Algorithms for Combinatorial Optimization should be known.

Course introduction
The goal of the course is giving to the students the capacity to recognize, formulate and devise a solution method for optimization problems that arise in scheduling, timetabling and routing.

Expected learning outcome
After the course, the student is expected to be able to:

  • Recognize and classify problems arising in scheduling, timetabling and routing while making use of opportune formal notation.
  • Devise solution approaches by means of general optimization methods such as mixed integer programming, constraint programming and local search.
  • Discuss in detail a few dedicated algorithms for specific cases treated in the lectures;
  • Analyze the solution methods with respect to computation time.
Subject overview
The course will teach mathematical modeling and optimization in the three industrial application areas of production planning, service timetabling and vehicle routing. Examples of applications that will be treated during the course are

  • flow shop and job shop scheduling, resource constrained project scheduling
  • crew and workforce scheduling, education timetabling, employee timetabling
  • vehicle routing with constraints on capacities, time windows and visit order.

For each case, the problem will be precisely formulated and modeled within one of the general purpose solution frameworks. Mixed integer programming and heuristics as well as dedicated algorithms based on dynamic programming or branch and bound, will be outlined in the cases where these algorithms are feasible. The course includes group work with practical exercises on realistic data.

Literature
There isn't any litterature for the course at the moment.

Website
This course uses e-learn (blackboard).

Prerequisites for participating in the exam
None

Assessment and marking:
Oral exam graded with an external examiner and Danish 7 mark scale.

Reexamination in the same exam period or immediately thereafter

Expected working hours
The teaching method is based on three phase model.
Intro phase: 16 hours
Skills training phase: 12 hours

Educational activities Study phase: 10 hours

Language
This course is taught in Danish or English, depending on the lecturer. However, if international students participate, the teaching language will always be English.

Course enrollment
See deadline of enrolment.

Tuition fees for single courses
See fees for single courses.