Minimizing total completion time subject to release dates and sequence-dependent processing times
From MaRDI portal
Publication:1290157
DOI10.1023/A:1018975323093zbMath0921.90089OpenAlexW1481291097MaRDI QIDQ1290157
Stefano Giordani, Paolo Dell'Olmo, Lucio Bianco
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018975323093
dynamic programmingsingle machineheuristic algorithmsrelease datestotal completion timesequence-dependent processing timesadditional time constraintscumulative traveling salesman problemsequencing landing aircraft
Related Items
On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport, A 3/2-Approximation for the Metric Many-Visits Path TSP, A dynamic programming approach for the aircraft landing problem with aircraft classes, An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems, Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations, Minimizing deviation from scheduled times in a single mixed-operation runway, Airport runway scheduling, Lessons from building an automated pre-departure sequencer for airports, Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem, Scheduling models for air traffic control in terminal areas, The aircraft runway scheduling problem: a survey, Aircraft landing problems with aircraft classes, Heuristics for flights arrival scheduling at airports, An algorithm for single- and multiple-runway aircraft landing problem, A new intelligent approach for air traffic control using gravitational search algorithm, An optimal data-splitting algorithm for aircraft sequencing on a single runway, Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
