Route Constrained Fleet Scheduling

Clifford S. Orloff
Additional contact information
Clifford S. Orloff: Princeton University, Princeton, New Jersey

Transportation Science, 1976, vol. 10, issue 2, 149-168

Abstract: 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 date 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.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.10.2.149 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:10:y:1976:i:2:p:149-168

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().