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

The assignment of minimum crews among bases in an airlift operation

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

DOI10.1016/0377-2217(89)90105-7zbMath0658.90057OpenAlexW2025749792MaRDI QIDQ1111931

M. Jeya Chandra, Tom M. Cavalier, Jae-Dong Hong

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90105-7


zbMATH Keywords

stochastic processeslogisticsairlift operationcrew allocationmean idle time


Mathematics Subject Classification ID

Operations research and management science (90B99)


Related Items (1)

A heuristic algorithm to minimize the number of crews allocated in an airlift operation




Cites Work

  • The analysis of a single base in an airlift operation
  • The art and theory of dynamic programming
  • A Heuristic Algorithm for Assigning Crews among Bases in an Airlift Operation




This page was built for publication: The assignment of minimum crews among bases in an airlift operation

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