OR PRACTICE—The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment

References

• Ahuja R., Magnanti T., Orlin J.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bard J. F., Kontoravdis G., Yu G. A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Sci. (2002) 36(2):250–269Link, Google Scholar
• Bertsimas D., Patterson S. The traffic flow management rerouting problem in air traffic control: A dynamic network flow approach. Transportation Sci. (2000) 33(3):239–255Link, Google Scholar
• Bixby R., Lee E. Solving a truck dispatching scheduling problem using branch-and-cut. Oper. Res. (1998) 46(3):355–367Link, Google Scholar
• Clausen J., Larsen A., Larsen J. Disruption management in the airline industry—Concepts, models, and methods. (2005) . IMM-Technical Report, Informatics and Mathematical Modeling, Technical University of Denmark, DTU, Lyngby, DenmarkGoogle Scholar
• Crowder H., Johnson E. L., Padberg M. Solving large-scale zero-one linear programming problems. Oper. Res. (1993) 31:803–834Link, Google Scholar
• Dantzig G., Fulkerson D. R. Minimizing the number of tankers to meet a fixed schedule. Naval Res. Logist. Quart. (1954) 1:217–222Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science, Vol. 8, Network Routing (1995) (Elsevier Science Publications B. V., Amsterdam, The Netherlands) 35–140Google Scholar
• Ford L. R., Fulkerson D. R. Maximal flow through a network. Canadian. J. Math. (1956) 8:399–404Crossref, Google Scholar
• Gendreau M., Guertin F., Potvin J. Y., Taillard É. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33(4):381–390Link, Google Scholar
• Hoffman K., Padberg M. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. (1991) 3(2):121–134Link, Google Scholar
• Hoffman K., Padberg M. Solving airline crew-scheduling problems by branch-and-cut. Management Sci. (1993) 39:657–682Link, Google Scholar
• Klabjan D., Johnson E. L., Nemhauser G., Gelman E., Ramaswamy S. Airline crew scheduling with time windows and plane-count constraints. Transportation Sci. (2002) 36(3):337–348Link, Google Scholar
• Lourenço H., Paixã J. P., Portugal R. Multiobjective metaheuristics for the bus driver scheduling problem. Transportation Sci. (2001) 35(3):331–343Link, Google Scholar
• Oh S. C., Haghani A. Testing and evaluation of a multi-commodity multi-modal network flow model for disaster relief management. J. Advanced Transportation (1997) 31(3):249–282Crossref, Google Scholar
• Zawack D. J., Thompson G. L. A dynamic space-time network flow model for city traffic congestion. Transportation Sci. (1987) 21(3):153–162Link, Google Scholar