Dell'Olmo Paolo

Paolo Dell'Olmo

Information about the author Paolo Dell'Olmo will soon be added to the site.
Found 19 papers in total
Evaluating the effects of the clique selection in exact graph colouring algorithms
Evaluating the effects of the clique selection in exact graph colouring algorithms
2011
It is a common practice in exact enumerative algorithms for graph colouring to find a...
Novel Local-Search-Based Approaches to University Examination Timetabling
Novel Local-Search-Based Approaches to University Examination Timetabling
2008
Examination timetabling assigns examinations to a given number of time slots so that...
Coupling stochastic and deterministic local search in examination timetabling
Coupling stochastic and deterministic local search in examination timetabling
2007
In this paper, we propose a novel optimization algorithm for examination timetabling....
Scheduling models for air traffic control in terminal areas
Scheduling models for air traffic control in terminal areas
2006
We propose a job-shop scheduling model with sequence dependent set-up times and...
A dynamic programming approach for the airport capacity allocation problem
A dynamic programming approach for the airport capacity allocation problem
2003
In most of the optimization models developed to manage airports operations, arrivals...
Lower bound algorithms for multiprocessor task scheduling with ready times
Lower bound algorithms for multiprocessor task scheduling with ready times
2005
In this paper, we deal with multiprocessor task scheduling with ready times and...
A dynamic programming approach for the airport capacity allocation problem
A dynamic programming approach for the airport capacity allocation problem
2003
In most of the optimization models developed to manage airports operations, arrivals...
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
2005
Monitoring flows on networks is a research area for which a number of applications are...
On finding dissimilar Pareto-optimal paths
On finding dissimilar Pareto-optimal paths
2005
The aim of the present paper is to provide a methodology for finding a set of...
Scheduling multiprocessor tasks on two parallel processors
Scheduling multiprocessor tasks on two parallel processors
2002
In this work scheduling multiprocessor tasks on two parallel identical processors is...
Planning activities in a network of logistic platforms with shared resources
Planning activities in a network of logistic platforms with shared resources
2004
This paper has been motivated by the study of a real application, the transshipment...
Scheduling multiprocessor tasks on parallel processors with limited availability
Scheduling multiprocessor tasks on parallel processors with limited availability
2003
In this work we consider the problem of scheduling multiprocessor tasks on parallel...
A new hierarchical architecture for Air Traffic Management: optimisation of airway capacity in a Free Flight scenario
A new hierarchical architecture for Air Traffic Management: optimisation of airway capacity in a Free Flight scenario
2003
We describe a new two-level hierarchical architecture for air traffic management...
Iterative coloring extension of a maximum clique
Iterative coloring extension of a maximum clique
2001
In this paper we present an improved branch and bound algorithm for the vertex...
Scheduling of client-server applications
Scheduling of client-server applications
1999
In this paper, we analyze the problem of deterministic scheduling of applications...
Scheduling multiprocessor tasks for mean flow time criterion
Scheduling multiprocessor tasks for mean flow time criterion
2000
Multiprocessor tasks are executed by more than one processor at the same moment of...
Minimizing makespan in a multimode multiprocessor shop scheduling problem
Minimizing makespan in a multimode multiprocessor shop scheduling problem
1999
We study the problem of multimode scheduling tasks on dedicated processors, with the...
‘Strong’–‘weak’ chain constrained scheduling
‘Strong’–‘weak’ chain constrained scheduling
1997
In this paper we introduce a distinction between the weak and strong modes of...
Minimizing total completion time subject to release dates and sequence-dependent processing times
Minimizing total completion time subject to release dates and sequence-dependent processing times
1999
We consider the problem of scheduling jobs with release dates and sequence-dependent...
Papers per page: