Time-Indexed Formulations for the Runway Scheduling Problem.
Pasquale AvellaMaurizio BocciaCarlo ManninoIgor VasilyevPublished in: Transp. Sci. (2017)
Keyphrases
- scheduling problem
- single machine
- flowshop
- np hard
- tabu search
- minimizing makespan
- permutation flowshop
- precedence constraints
- processing times
- parallel machines
- earliness tardiness
- optimization methods
- job shop scheduling problem
- maximum lateness
- greedy algorithm
- data sets
- list scheduling
- strongly np hard
- release dates
- valid inequalities
- inverted file
- data structure