On a Fleet Sizing and Allocation Problem

S. C. Parikh
Additional contact information
S. C. Parikh: Stanford University

Management Science, 1977, vol. 23, issue 9, 972-977

Abstract: This paper deals with a practical application of queueing theory. In particular, an approximate but quick method is developed for solving a fleet sizing and allocation problem. The problem concerns an optimal allocation of the total available transport vehicle units to many fleets in such a way that all fleets provide (as nearly as possible) a uniform level of service. The level of service is measured in terms of the fraction of arriving orders for shipment delayed due to the lack of immediate availability of a transport vehicle unit. The method employs some new results in queueing theory for approximating the delay probability and the service facility size in multi-server systems. An illustrative example is included to demonstrate a way of applying the method.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.9.972 (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:ormnsc:v:23:y:1977:i:9:p:972-977

Access Statistics for this article

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