首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Approximate queueing models for analyzing harbor terminal operations
Institution:1. Collaborative Autonomic Computing Laboratory, School of Computer Science, University of Electronic Science and Technology of China, Chengdu, China;2. The Israel Electric Corporation, PO Box 10, Haifa 31000, Israel;3. University of Massachusetts, Dartmouth MA 02747, USA
Abstract:The purpose of this paper is to present approximate queueing models to help assess the impacts of tug services on congested harbor terminals. The models are intended for harbors in which tug shortages are rare. A congested harbor terminal is modelled as a queueing system with m identical tugs (servers) and n identical berths (customers), and with general probability distributions of tug service time and berth cargo-handling time. The distribution of the number of berths in the system, a basic element to analyze the system performance, was established for two cases. For large m, the distribution was approximated by a binomial model and the respective accuracy tested. For small m, an approximate model for this distribution was developed. Particular emphasis was given to developing explicitly the probability of having one berth in queue and establishing the remaining probabilities of the distribution approximately. The model for small m was validated by means of simulation for various cases of harbor terminal operations exhibiting different ranges of the coefficient of variation of tug service time. The models were found to be reasonably accurate within a certain range covering situations in which tug shortages are in the order of 10% of the time or less.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号