Planning and Scheduling Methodologies

Code:

EIC0063

Acronym:

MPES

Keywords
Classification	Keyword
OFICIAL	Artificial Intelligence

Instance: 2010/2011 - 2S

Active?	Yes
Web Page:	http://paginas.fe.up.pt/~eol/PRODEI/mpe1011_eng.htm
E-learning page:	http://moodle.fe.up.pt/
Responsible unit:	Department of Informatics Engineering
Course/CS Responsible:	Master in Informatics and Computing Engineering

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
MIEIC	17	Syllabus since 2009/2010	4	-	6	56	162

Teaching language

Suitable for English-speaking students

Objectives

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

Expected competences:
- To know how to apply the conventional Planning and Scheduling methods to job shop and other processes and projects;
- To be able to deliberate about when and how to apply AI-based methods for Planning.

Program

Definitions of Planning and Scheduling. Planning vs Scheduling. Introduction to Planning and Scheduling conventional methodologies; CPM and PERT. 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.

Cooperative planning and scheduling.

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

Mandatory literature

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

Complementary Bibliography

Barry McCollum et al.; International Timetabling Competition, 2007
ICAPS - International Conference on Automated Planning and Scheduling, 2011

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
Projects and Assignments	Defesa pública de dissertação, de relatório de projeto ou estágio, ou de tese	77,00
Demonstrations and Oral Presentations	Exame	6,00
	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

Approval in the course obligates to acquire a grade greater than 9,5 points (in 20).

Calculation formula of final grade

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

Development of a complete planning/scheduling application:
* Intermediate presentation of the work (20%)
* 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). Students must arrange with teachers appropriate dates for presenting their assignments.

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). Students must arrange with teachers appropriate dates for presenting their assignments.