Go to:
Logótipo
Esta página em português Ajuda Autenticar-se
Formação regular da Biblioteca |fevereiro a maio
You are here: Start > PRODEI017
Authentication




Site map
Edifício A (Administração) Edifício B (Aulas) - Bloco I Edifício B (Aulas) - Bloco II Edifício B (Aulas) - Bloco III Edifício B (Aulas) - Bloco IV Edifício C (Biblioteca) Edifício D (CICA) Edifício E (Química) Edifício F (Minas e Metalurgia) Edifício F (Minas e Metalurgia) Edifício G (Civil) Edifício H (Civil) Edifício I (Electrotecnia) Edifício J (Electrotecnia) Edifício K (Pavilhão FCNAUP) Edifício L (Mecânica) Edifício M (Mecânica) Edifício N (Garagem) Edifício O (Cafetaria) Edifício P (Cantina) Edifício Q (Central de Gases) Edifício R (Laboratório de Engenharia do Ambiente) Edifício S (INESC) Edifício T (Torre do INEGI) Edifício U (Nave do INEGI) Edifício X (Associação de Estudantes)

Planning and Scheduling Methodologies

Code: PRODEI017     Acronym: MPE

Keywords
Classification Keyword
OFICIAL Intelligent Systems

Instance: 2018/2019 - 2S Ícone do Moodle

Active? Yes
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 5 Syllabus 1 - 6 28 162

Teaching - Hours

Recitations: 2,00
Type Teacher Classes Hour
Recitations Totals 1 2,00
Luís Paulo Gonçalves dos Reis 2,00

Teaching language

English

Objectives

To address planning and scheduling problems in an integrated perspective.

To study traditional approaches to planning and scheduling problems.

To explore recent planning and scheduling methodologies, based on heuristic algorithms from the domain of Artificial Intelligence.

To apply heuristic techniques for planning and scheduling in problems of medium complexity.

Learning outcomes and competences

To get acquainted with the main approaches to solve planning and scheduling problems.

To know how to apply traditional planning and scheduling methods.

To be able to identify planning and scheduling problems that require heuristic methods (from the domain of Artificial Intelligence).

To know how to apply heuristic methods to planning and scheduling problems of medium complexity.

Working method

Presencial

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.

Scheduling problems. Machines and jobs. Performance measures. Classification of scheduling problems. The alpha|beta|gamma notation. Machines: number, type. Job shop, flow shop and open shop. Scheduling constraints: preemption, no-wait, precedences. Objective function: makespan, lateness, tardiness. Deterministic and stochastic scheduling models.

Complexity of scheduling problems. Decision vs. optimization. The NP-Complete class of problems. Approximation algorithms.

Scheduling algorithms. Branch and bound. Dispatching rules. Local search algorithms. Hill-climbing. Simulated annealing. Tabu search. Genetic algorithms. Ant colony optimization. Constraint programming.

Modeling and solving of real world planning and scheduling problems.

Mandatory literature

Pinedo, Michael; Scheduling. ISBN: 0-13-706757-7
Brucker, Peter; Scheduling algorithms. ISBN: 3-540-20524-1
ed. by Joseph Y-T. Leung; Handbook of scheduling. ISBN: 1-584-88-397-9
Michel Gendreau, Jean-Yves Potvin (eds); Handbook of Metaheuristics, Springer, 2010. ISBN: 978-1-4419-1663-1

Complementary Bibliography

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

Teaching methods and learning activities

Introduction to the subjects in an interactive way. Project-oriented learning. Practical assignments assisted development.

keywords

Physical sciences > Computer science > Cybernetics > Artificial intelligence
Physical sciences > Mathematics > Applied mathematics > Operations research

Evaluation Type

Distributed evaluation without final exam

Assessment Components

Designation Weight (%)
Trabalho escrito 40,00
Trabalho laboratorial 60,00
Total: 100,00

Amount of time allocated to each course unit

Designation Time (hours)
Elaboração de relatório/dissertação/tese 20,00
Estudo autónomo 15,00
Frequência das aulas 28,00
Trabalho de investigação 34,00
Trabalho laboratorial 65,00
Total: 162,00

Calculation formula of final grade

Distributed evaluation without final exam.

Assignment/Project (100%):

  • Interim presentation about the topic and approach (30%)
  • Final report in the form of a Scientific Paper (40%)
  • Final presentation of the assignment (oral/demo) (30%)

 

Examinations or Special Assignments

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

Special assessment (TE, DA, ...)

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

Classification improvement

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

Recommend this page Top
Copyright 1996-2019 © Faculdade de Engenharia da Universidade do Porto  I Terms and Conditions  I Accessibility  I Index A-Z  I Guest Book
Page generated on: 2019-05-22 at 14:28:23