DM/DMP87 (10 ECTS)
Skedulering, Skemalægning og Ruteplanlægning
Scheduling, Timetabling and Routing
Marco Chiarandini, post doc.
[email protected]
http://www.imada.sdu.dk/~marco/DM87
IMADA
University of Southern Denmark
Scheduling
DM/DMP87 – Scheduling, Timetabling and Routing
Scheduling
DM/DMP87 – Scheduling, Timetabling and Routing
Gantt chart
Timetabling
DM/DMP87 – Scheduling, Timetabling and Routing
Timetabling
DM/DMP87 – Scheduling, Timetabling and Routing
Timetabling
DM/DMP87 – Scheduling, Timetabling and Routing
Vehicle Routing
DM/DMP87 – Scheduling, Timetabling and Routing
Sources
DM/DMP87 – Scheduling, Timetabling and Routing
I Jakob Skov, Scheduling of an Anodizing Plant at Bang & Olufsen.
Master Thesis, 2007.
I Anders Rasmussen. Skemalgning for naturvidenskab ved SDU.
Master Thesis, 2007
I Steffen Elberg Godskesen. Automated Planning of Work for Home Nurses.
Master Thesis, 2006.
Contents: Modeling
DM/DMP87 – Scheduling, Timetabling and Routing
Scheduling
Constraints
Activities
Resources
Objectives
Single and Parallel
Machine
Flow Shop and Flexible
Flow Shop
Job Shop, Open Shop
Contents: Modeling
DM/DMP87 – Scheduling, Timetabling and Routing
Timetabling
I Interval Scheduling, Reservations
Rooms
I Educational and Employee Timetabling
R1
R2
R3
..
.
Rr
P1
−
L1
L2
..
.
L3
P2
L4
L5
L6
L7
···
···
···
..
.
···
Periods
Pi
Pj
L10 · · · L14
L11 · · · L15
L12 · · · −
..
.
L13
L16
I Transportation Timetabling
···
···
···
..
.
···
P45
−
−
−
−
Contents: Modeling
DM/DMP87 – Scheduling, Timetabling and Routing
Vehicle Routing
TSP
ng
auli
kh
Bac
VRPB
VRP
Route length
DCVRP
Mixe
d se
rvice
Time Windows
CVRP
VRPTW
VRPBTW
VRPPD
VRPPDTW
Contents: Solution Techniques
I Mathematical Programming
I Networks
I Branch and Bound
I Constraint Programming
I Dedicated algorithms
I Dispatching Rules and Construction Heuristics
I Metaheuristics: SA, Tabu Search, GA
DM/DMP87 – Scheduling, Timetabling and Routing
Contents: Solution Techniques
DM/DMP87 – Scheduling, Timetabling and Routing
I Mathematical Programming
I Networks
I Branch and Bound
I Constraint Programming
I Dedicated algorithms
I Dispatching Rules and Construction Heuristics
I Metaheuristics: SA, Tabu Search, GA
Course prerequisites
I MM02 (linear algebra)
I DM02 (algorithms and data structures)
I The content of DM63 should be known
I DM85 (Networks and Integer Programming) would be reccomended
Students’ Activity
DM/DMP87 – Scheduling, Timetabling and Routing
During the Course (30 hours of lectures, 2-4 hours per week)
I Study concepts from text book and additional materials
(5-6 hours per week of work load)
I Apply the knowledge on the case studies proposed in class
(participatory discussions)
I Read and present an article
Final Assessment (10 ECTS)
I Oral exam of 30 minutes with external examiner (60% of final grade)
meant to assess the base knowledge
I Group project (40% of the final grade)
approved choice of a case study
deliverables: program + report
meant to assess to ability to apply
Course Material
DM/DMP87 – Scheduling, Timetabling and Routing
Text book:
I M.L. Pinedo, Planning and Scheduling in Manufacturing and Services;
Springer Series in Operations Research and Financial Engineering, 2005,
(388 DKK)
Supplementary books:
I M.L. Pinedo, Scheduling: Theory, Algorithms, and Systems; 2nd ed.,
Prentice Hall, 2002.
I P. Toth, D. Vigo, eds. The Vehicle Routing Problem, SIAM Monographs on
Discrete Mathematics and Applications, Philadelphia, 2002.
Further literature:
I Lecture notes
I Articles
DM/DMP87 (10 ECTS)
Skedulering, Skemalægning og Ruteplanlægning
Scheduling, Timetabling and Routing
Marco Chiarandini, post doc.
[email protected]
http://www.imada.sdu.dk/~marco/DM87
IMADA
University of Southern Denmark