Skip navigation
User training | Reference and search service

Library catalog

Retrievo
EDS
b-on
More
resources
Content aggregators
Please use this identifier to cite or link to this item:

acessibilidade

http://hdl.handle.net/10071/5694
acessibilidade
Title: Queueing networks with infinite servers in each node (an application in logistics)
Authors: Ferreira, Manuel Alberto M.
Keywords: M|G|∞
Network of queues
Busy period
Logistics
Issue Date: 2004
Publisher: Slovak University of Technology
Abstract: After a report of results about queueing systems with infinite servers, namely considering its busy period, we intend to build a model, using networks of queues with infinite servers in each node, to study a two echelons repair system of a fleet of aircraft,of shipping or of trucking. The customers are the failures. And its service time is the time that goes from the instant at which they occur till the one at which they are completely repaired. The failures repairs occur in a base or in a remote station. The whole failures detected in the base are repaired there. Some of the failures detected in the station are repaired in the base, and the others in the station. The results referred above, about the infinite servers queues busy period, allow the determination of the two echelons repair system performance measures. In this application we work over models of Carrillo (1991) and Ferreira (1996) that we improve and complete. We will illustrate the theory with a very simple and short numerical example.
Peer reviewed: Sim
URI: http://hdl.handle.net/10071/5694
Appears in Collections:DM-CRI - Comunicações a conferências internacionais

Files in This Item:
acessibilidade
File Description SizeFormat 
Ferreira 2004 APLIMAT 3RD CONF 107-114.pdf800.45 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Currículo DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.