Scheduling of Time-Shared Jet Aircraft

Published Online:https://doi.org/10.1287/trsc.32.3.277

References

  • Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Arkin E. M. , Silverberg E. B. Scheduling jobs with fixed start and end times. Discrete Appl. Math. (1987) 18 1 8 CrossrefGoogle Scholar
  • Bianco L. , Mingozzi A. , Ricciardelli S. A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Software (1994) 3 163 194 CrossrefGoogle Scholar
  • Bertossi A. A. , Carraresi P. , Gallo G. On some matching problems arising in vehicle scheduling models. Networks (1987) 17 271 281 CrossrefGoogle Scholar
  • Bodin L. , Golden B. , Assad A. , Ball M. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10 63 211 CrossrefGoogle Scholar
  • Bodin L. , Rosenfield D. , Kydes A. UCOST: A micro approach to a transit planning problem. J. Urban Anal. (1978) 5 47 69 Google Scholar
  • Bryant A. Gulfstream in venture for time sharing of its corporate aircraft. The New York Times (1995) November 16 4 Google Scholar
  • Carpaneto G. , Dell'Amico M. , Fischetti M. , Toth P. A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks (1989) 19 531 548 CrossrefGoogle Scholar
  • Ceder A. , Stern H. I. Deficit function bus scheduling with deadheading trip insertions for fleet size reduction. Transportation Sci. (1981) 15 338 363 LinkGoogle Scholar
  • Dell'Amico M. , Fischetti M. , Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. (1993) 39 1 115 125 LinkGoogle Scholar
  • Del Valle C. Can't afford a lear? Buy a piece of one. Business Week (1995) September 11 132 Google Scholar
  • Garey M. , Johnson D. Computers and Intractibility: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, New York) Google Scholar
  • Hall N. G. , Magazine M. J. Maximizing the value of a space mission. Eur. J. Oper. Res. (1994) 78 224 241 CrossrefGoogle Scholar
  • Keskinocak P. , Tayur S. Assigning off-days for multiple types of workers in seven-days-a-week operations. (1996) . GSIA Working paper, Carnegie Mellon University, Pittsburgh, PA Google Scholar
  • Kolen A. W. J. , Kroon L. G. On the computational complexity of (maximum) class scheduling. Eur. J. Oper. Res. (1991) 54 23 38 CrossrefGoogle Scholar
  • Kolen A. W. J. , Kroon L. G. On the computational complexity of (maximum) shift class scheduling. Eur. J. Oper. Res. (1993) 64 138 151 CrossrefGoogle Scholar
  • Powell W. B. , Gittoes D. H. A generalized labeling algorithm for the dynamic assignment problem. (1994) . Department of Civil Engineering and Operations Research Report, Princeton University, Princeton, NJ Google Scholar
  • Ribeiro C. C. , Soumis F. A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. (1994) 42 1 41 52 LinkGoogle Scholar
  • Savelsbergh M. W. P. , Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29 1 17 29 LinkGoogle Scholar
  • Solomon M. M. , Desrosiers J. Time window constrained routing and scheduling problems. Transportation Sci. (1988) 22 1 1 13 LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.