Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

Hello!

I am a teacher at the Faculty of Economics, University of Porto, and a researcher at LIAAD, one of INESC TEC's  research groups.

My research mostly involves the development and application of (meta)heuristic procedures to combinatorial optimization problems, particularly scheduling problems. Currently, I am also learning data mining.

Interest
Topics
Details

Details

  • Name

    Jorge Valente
  • Cluster

    Computer Science
  • Role

    Research Coordinator
  • Since

    01st October 2012
Publications

2018

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Authors
Fernandez Viagas, V; Valente, JMS; Framinan, JM;

Publication
EXPERT SYSTEMS WITH APPLICATIONS

Abstract
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario. Although several approximate algorithms have been proposed for this problem in the literature, recent contributions for related problems suggest that there is room for improving the current available algorithms. Thus, our contribution is twofold: First, we propose a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function. Second, using this constructive heuristic as initial solution, eight variations of an iterated-greedy-based algorithm are proposed. A comprehensive computational evaluation is performed to establish the efficiency of our proposals against the existing heuristics and metaheuristics for the problem.

2018

Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines

Authors
Schaller, J; Valente, JMS;

Publication
Computers and Industrial Engineering

Abstract
Scheduling jobs on a set of identical parallel machines using efficient heuristics when the objective is to minimize total weighted squared tardiness is considered. Two efficient heuristics and an improvement procedure are presented for the problem. These heuristics and other heuristics are tested using problem sets that represent a variety of conditions. The results show that one of the heuristics consistently performs better than the other heuristics tested. It is also shown how these heuristics can be incorporated into other procedures such as the existing Lagrangian relaxation procedure or meta-heuristics to obtain improved solutions for medium sized problems. © 2018 Elsevier Ltd

2017

What catches the eye in class observation? Observers' perspectives in a multidisciplinary peer observation of teaching program

Authors
Torres, AC; Lopes, A; Valente, JMS; Mouraz, A;

Publication
TEACHING IN HIGHER EDUCATION

Abstract
Peer Observation of Teaching has raised a lot of interest as a device for quality enhancement of teaching. While much research has focused on its models, implementation schemes and feedback to the observed, little attention has been paid to what the observer actually sees and can learn from the observation. A multidisciplinary peer observation of teaching program is described, and its data is used to identify the pedagogical aspects to which lecturers pay more attention to when observing classes. The discussion addresses the valuable learning opportunities for observers provided by this program, as well as its usefulness in disseminating, sharing and clarifying quality teaching practices. The need for further research concerning teacher-student relationships and students' engagement is also suggested.

2016

Metaheuristics for the single machine weighted quadratic tardiness scheduling problem

Authors
Goncalves, TC; Valente, JMS; Schaller, JE;

Publication
COMPUTERS & OPERATIONS RESEARCH

Abstract
This paper considers the single machine scheduling problem with weighted quadratic tardiness costs. Three metaheuristics are presented, namely iterated local search, variable greedy and steady-state genetic algorithm procedures. These address a gap in the existing literature, which includes branch-and-bound algorithms (which can provide optimal solutions for small problems only) and dispatching rules (which are efficient and capable of providing adequate solutions for even quite large instances). A simple local search procedure which incorporates problem specific information is also proposed. The computational results show that the proposed metaheuristics clearly outperform the best of the existing procedures. Also, they provide an optimal solution for all (or nearly all, in the case of the variable greedy heuristic) the smaller size problems. The metaheuristics are quite close in what regards solution quality. Nevertheless, the iterated local search method provides the best solution, though at the expense of additional computational time. The exact opposite is true for the variable greedy procedure, while the genetic algorithm is a good all-around performer.

2013

A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

Authors
Schaller, J; Valente, JMS;

Publication
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Abstract
This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.

Supervised
thesis

2017

Os Potenciais Hinterlands dos Portos Portugueses para Cargas Contentorizadas, Baseado nas Acessibilidades Rodoviárias.

Author
Pedro Vasco e Silva Cardoso

Institution
UP-FEP

2016

Metaheuristics for the Weighted Squared Tardiness Permutation Flowshop Scheduling Problem

Author
Andreia Fernandes da Silva

Institution
UP-FEP

2015

Heuristics for a permutation flowshop scheduling problem with weighted squared tardiness

Author
Maria Raquel de Carvalho Costa

Institution
UP-FEP

2015

Impacto do encerramento da urgência básica de Valongo na afluência ao serviço de urgência do Hospital de São João e Cuidados de Saúde primários de Valongo

Author
Elisabete dos Santos Alves

Institution
UP-FEP

2015

O impacto económico do programa de intervenção de enfermagem de gestão da doença na DPOC do Centro Hospitalar do Porto – Hospital Santo António

Author
Susana Maria Rodrigues da Cruz

Institution
UP-FEP