Lower bound on fleet-size in variable-schedule fleet-size problem

dc.contributor.author	Ankolekar, Suresh
dc.contributor.author	Patel, Nitin R.
dc.date.accessioned	2010-03-14T09:55:52Z
dc.date.available	2010-03-14T09:55:52Z
dc.date.copyright	1985-09
dc.date.issued	2010-03-14T09:55:52Z
dc.identifier.uri	http://hdl.handle.net/11718/1174
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;1985/581
dc.subject	Time management	en
dc.subject	Transportation	en
dc.title	Lower bound on fleet-size in variable-schedule fleet-size problem	en
dc.type	Working Paper	en