A Lower Bound on Fleet-Size in Variable-Schedule Fleet-Size Problem

Ankolekar Suresh and Patel Nitin R

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: This paper discusses an approach to compute a lower bound on fleet-size in variable-schedule fleet-size problem. The lower bound is computed in two stages. In stage one, a fixed-schedule fleet-size problem is solved for a relaxed set of trips where each trips is assumed to be departing at its latest permissible departure time and yet arrive at earliest arrival time resulting in reduced elapsed time. In second stage the lower bound is augmented by the minimum additional fleet-size required to make each trip individually restorable to its original elapsed time.

Date: 1985-09-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:iim:iimawp:wp00657

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().