Container terminal as a queening transport networks

• Autorzy: Smolarek L. , Wilczyński P.

Identyfikatory

DOI

10.5604/12314005.1133228

• Języki publikacji: EN

Abstrakty

EN

The queuing networks consist of several connected simple queuing system. In container terminal as an open network containers enter the queuing network from sea and landside, received adequately service at system and leave the network. Jackson’s network is simplest form of queuing networks, characterized by unlimited overall numbers of customers belong to the one class of customers. Customer – containers arrived' system with exponential arrival pattern (Poison or Erlang) and are served on single or multi-channel servers with exponential service time.􀀃Another case of queuing networks is network of Kelly with different classes of customers (containers) but each class of containers has fixed route (service model) in the transport system. The Baskett, Chandy, Muntz and Palacios – BCMP networks include different class of customers, with different queuing discipline and generally distributed time. Routes (service model) through the network may depend on the class of customers – containers, and the containers can change its class while passing through the system. This article describes different queuing networks, which can be used to modelling of the container terminal as a queuing transport network. The Queuing Theory may be used to determine the appropriate level of capacity required at container terminal and the staffing levels required at service facilities, over the nominal average capacity required to service expected demand. The model of the container terminal called a queuing network had better represent the real structure then a single system.

Słowa kluczowe

EN

container terminal; queuing theory; queuing networks

• Wydawca: Łukasiewicz Research Network - Institute of Aviation ; European Science Society of Powertrain and Transport KONES Poland ; Wydawnictwo Instytutu Technicznego Wojsk Lotniczych
• Czasopismo: Journal of KONES
• Rocznik: 2014
• Tom: Vol. 21, No. 3
• Strony: 265--270
• Opis fizyczny: Bibliogr. 7 poz., rys.

Twórcy

autor

Smolarek L.

• Gdynia Maritime University, Department of Transport and Logistics Morska Street 81-87, Gdynia, Poland tel.:[phone], tel./fax [phone]

autor

Wilczyński P.

• Gdynia Maritime University, Department of Ship’s Operation 3 Jana Pawla II Av. 81-345 Gdynia, Poland tel.:[phone], phone [phone]

Bibliografia

• [1] Bitran, G., Caldentey, R., Two-Class Priority Queueing System with State-Dependent Arrivals, Kluwer Academic Publishers, Queueing Systems 40, pp. 355-382, 2002.
• [2] Chydziński, A., The M-M/G/1-type oscillating systems, Cybernetics and systems analysis, 2, Vol. 39, pp. 313-324, 2003.
• [3] Filipowicz, B., Kwiecień, J., Queueing systems and networks, Models and applications, Bulletin of the Polish Academy of Sciences Technical Sciences, 4, T. 56. pp. 379-390, 2008.
• [4] Jaiswal, N. K, Priority Queues, Academic Press, New York 1968.
• [5] Klimów, G. P., Procesy obsługi masowej, Wydawnictwo Naukowo-Techniczne, Warszawa 1979.
• [6] Konig, D., Stoyan, D., Metody teorii obsługi masowej, Wydawnictwo Naukowo-Techniczne, Warszawa 1979.
• [7] Łazowska, E. D., Zahorjan, J., Graham G. S., Sevcik, K. C., Quantitative System Performance, Prentice-Hall, Inc., Englewood Cliffs, New Jersey 1984.