ROUTE CONSTRAINED FLEET SCHEDULING

This paper attempts to provide some insight into the structure of a large class of fleet scheduling problems. Scheduling under fixed due date constraints is shown to be easily solved using a new formulation of the problem. Scheduling under flexible due data constraints is shown to be inherently complex, and strong evidence is given for asserting that no efficient (polynomial bounded) algorithm exists for solving this problem exactly. A fast heuristic approach is described which has worked well in some school bus scheduling applications.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

  428 East Preston Street
  Baltimore, MD  United States  21202
• Authors:
  • Orloff, C S
• Publication Date: 1976-5

Media Info

• Features: References;
• Pagination: p. 149-168
• Serial:
  • Transportation Science
  • Volume: 10
  • Issue Number: 2
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Mathematical models; Operations; Planning; Routing; Scheduling; Transportation planning
• Old TRIS Terms: Operations planning
• Subject Areas: Administration and Management; Freight Transportation; Planning and Forecasting; Railroads;

Filing Info

• Accession Number: 00149395
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Apr 27 1977 12:00AM