Planning and Scheduling Methodologies

Code:

PRODEI017

Acronym:

MPE

Keywords
Classification	Keyword
OFICIAL	Intelligent Systems

Instance: 2009/2010 - 2S

Active?	Yes
Web Page:	http://paginas.fe.up.pt/~lpreis/mpe0910
Responsible unit:	Department of Informatics Engineering
Course/CS Responsible:	Doctoral Program in Informatics Engineering

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
PRODEI	4	Syllabus	1	-	7,5	70	200

Teaching language

English

Objectives

To use the most advanced scheduling and planning methodologies to solve complex scheduling and planning problems.

Program

Definitions of Planning and Scheduling. Planning vs Scheduling. Introduction to Planning and Scheduling methodologies, problems and applications.

Plan Automatic Generation: Means-Ends Analysis, Linear, non-linear, hierarchic and partially oriented planning. Planning and Learning: Plan generalization. Planning problems and applications.

Deterministic and stochastic scheduling models: Single machine, parallel machine, Flow Shop, Job Shop and Open Shop.

Scheduling problems complexity classes: The NP-Complete problem class.

Scheduling algorithms: Linear programming, dynamic programming, “Branch and Bound”, Local search heuristics, Tabu Search, Simulated Annealing, Genetic Algorithms, Neural Networks, Constraint Satisfaction. Cooperative planning and scheduling.

Real planning and scheduling problem modeling: Staff allocation, school timetabling, examination timetabling, International Timetabling Competition.

Mandatory literature

Pinedo, Michael; Scheduling. ISBN: 0-13-706757-7
Leung, Joseph Y-T; Handbook of scheduling. ISBN: 1-584-88-397-9
Brucker, Peter; Scheduling algorithms. ISBN: 3-540-20524-1

Complementary Bibliography

Barry McCollum et al., ;Barry McCollum et al., 2nd International Timetabling Competition ([online], available at:http://www.cs.qub.ac.uk/itc2007/ (consulted on 10/09/2007) )

Teaching methods and learning activities

Theoretical classes are used for exposition of the main scheduling and planning concepts, presentation and discussion of practical examples. Practical classes are used to solve exercises and for assisting students on their practical assignments.

Evaluation Type

Distributed evaluation without final exam

Assessment Components

Description	Type	Time (hours)	Weight (%)	End date
Attendance (estimated)	Participação presencial	42,00
Practical Assignment	Trabalho escrito	77,00
Demonstrations and Oral Presentation	Exame	6,00		2009-05-29
	Total:	-	0,00

Amount of time allocated to each course unit

Description	Type	Time (hours)	End date
Study	Estudo autónomo	37
	Total:	37,00

Eligibility for exams

Students approve in practical evaluation if they don’t exceed the fault limit and get a minimum of 33% grade in the required practical assignments.

Calculation formula of final grade

Distributed evaluation without final exam: Assignments/Project(100%):

Oral presentation about a Planning/Scheduling new trend (20%)

Development of a complete planning/scheduling application:
* Demonstration (30%)
* Final report: scientific paper (8/12 pages) (30%)
* Oral presentation (20%)

Examinations or Special Assignments

Assignments/Project (including: work, demo, paper and presentation).

Special assessment (TE, DA, ...)

Assignments/Project (including: work, demo, paper and presentation). Students must arrange with teachers appropriate dates for presenting their assignments.

Classification improvement

Assignments/Project (including: work, demo, paper and presentation).