Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem

From MaRDI portal
Publication:1717908
Jump to:navigation, search

DOI10.1155/2014/236756zbMath1407.90167OpenAlexW2095352591WikidataQ59064071 ScholiaQ59064071MaRDI QIDQ1717908

Bo Xu, Hui Huang, Ming Liu, Wei-Min Ma

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/236756



Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (2)

The aircraft runway scheduling problem: a survey ⋮ An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem


Uses Software

  • CPLEX


Cites Work

  • Scheduling Aircraft Landings—The Static Case
  • Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1717908&oldid=14040395"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki