Mele, Michele (2018) A Combinatorial Optimization Approach to Accessibility Services in International Airports. [Tesi di dottorato]

Anteprima

Testo TesiMELE.pdf Download (894kB) | Anteprima

[error in script] [error in script]

Tipologia del documento:	Tesi di dottorato
Lingua:	English
Titolo:	A Combinatorial Optimization Approach to Accessibility Services in International Airports
Autori:	Autore Email Mele, Michele michele.mele1991@gmail.com
Data:	6 Dicembre 2018
Numero di pagine:	68
Istituzione:	Università degli Studi di Napoli Federico II
Dipartimento:	Matematica e Applicazioni "Renato Caccioppoli"
Dottorato:	Scienze matematiche e informatiche
Ciclo di dottorato:	31
Coordinatore del Corso di dottorato:	nome email de Giovanni, Francesco francesco.degiovanni2@unina.it
Tutor:	nome email Festa, Paola [non definito]
Data:	6 Dicembre 2018
Numero di pagine:	68
Parole chiave:	Optimization; Accessibility
Settori scientifico-disciplinari del MIUR:	Area 01 - Scienze matematiche e informatiche > MAT/09 - Ricerca operativa
Depositato il:	19 Dic 2018 09:14
Ultima modifica:	30 Giu 2020 08:24
URI:	http://www.fedoa.unina.it/id/eprint/12486

Abstract

In this PhD thesis we study a specific variant of the well known Fixed Job Scheduling Problem, namely the Tactical Fixed Job Scheduling Problem with Spread-Time constraints. In this problem it is required to schedule a number of jobs on non identical machines that differ from each other for the set of jobs they can perform and that have constraints on the length of their duty. After providing an extensive literature review of the Fixed Job Scheduling and of its main variants, the original contribution is presented. We illustrate some lower bounds for the optimal value of the problem and display the first heuristic algorithm for solving it. We also study a specific case of interest connected with the assistance of passengers with special needs in large scale international airports.

Downloads

Actions (login required)

Modifica documento