The Trip Scheduling Problem

The set of feasible driver schedules is severely restricted by transportation department hours of service regulations. These restrictions are so severe that it is no longer a matter of simple forward simulation to establish whether it is feasible for a sequence of full truckload transportation requests, all with dispatch windows at the origin, to be executed by a driver. The authors consider the problem and use an algorithm to prove that the feasibility of a specific driver schedule can be checked in polynomial time. This allows the question of whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver to be answered.

  • Availability:
  • Authors:
    • Archetti, Claudia
    • Savelsbergh, Martin W P
  • Publication Date: 2009-11


  • English

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 417-431
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01148484
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 21 2010 6:08PM