Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operations

被引:38
作者
Dhingra, Vibhuti [1 ]
Kumawat, Govind Lal [2 ]
Roy, Debjit [2 ,3 ]
de Koster, Rene [3 ]
机构
[1] Univ British Columbia, Operat & Logist Div, Sauder Sch Business, Vancouver, BC V6T 1Z2, Canada
[2] Indian Inst Management Ahmedabad, Prod & Quantitat Methods Area, Ahmadabad 380015, Gujarat, India
[3] Erasmus Univ, Rotterdam Sch Management, Dept Technol & Operat Management, NL-3062 PA Rotterdam, Netherlands
关键词
Logistics; Queueing theory; Transportation; Stochastic modeling; PERFORMANCE ANALYSIS; STOCHASTIC-MODELS; SYSTEMS; OPTIMIZATION; APPOINTMENT; POLICIES;
D O I
10.1016/j.ejor.2017.12.020
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Semi-open queuing networks (SOQNs) are widely applied to measure the performance of manufacturing, logistics, communications, restaurant, and health care systems. Many of these systems observe variability in the customer arrival rate. Therefore, solution methods, which are developed for SOQNs with time-homogeneous arrival rate, are insufficient to evaluate the performance of systems which observe time-varying arrivals. This paper presents an efficient solution approach for SOQNs with time-varying arrivals. We use a Markov-modulated Poisson Process to characterize variability in the arrival rate and develop a matrix-geometric method (MGM)-based approach to solve the network. The solution method is validated through extensive numerical experiments. Further, we develop a stochastic model of the landside operations at an automated container terminal with time-varying truck arrivals and evaluate using the MGM-based approach. Results show that commonly used time-homogeneous approximation of time-varying truck arrivals is inaccurate (error is more than 15% in expected waiting time and expected number of trucks waiting outside the terminal) for performance evaluation of the landside operations. The application results are insightful in resource planning, demand leveling, and regulating the number of trucks permitted inside the terminal. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:855 / 876
页数:22
相关论文
共 37 条
  • [1] Creating an Inventory Hedge for Markov-Modulated Poisson Demand: An Application and Model
    Abhyankar, Hari S.
    Graves, Stephen C.
    [J]. Manufacturing and Service Operations Management, 2001, 3 (04): : 306 - 320
  • [2] [Anonymous], THESIS
  • [3] [Anonymous], QUEUEING NETWORKS MA
  • [4] APPROXIMATE QUEUING MODELS FOR MULTIPROGRAMMING COMPUTER SYSTEMS
    AVIITZHAK, B
    HEYMAN, DP
    [J]. OPERATIONS RESEARCH, 1973, 21 (06) : 1212 - 1230
  • [5] Time-dependent analysis for refused admissions in clinical wards
    Bekker, R.
    de Bruin, A. M.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2010, 178 (01) : 45 - 65
  • [6] PARAMETRIC ANALYSIS OF QUEUING NETWORKS
    CHANDY, KM
    HERZOG, U
    WOO, L
    [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1975, 19 (01) : 36 - 42
  • [7] Terminal appointment system design by non-stationary M(t)/Ek/c(t) queueing model and genetic algorithm
    Chen, Gang
    Govindan, Kannan
    Yang, Zhong-Zhen
    Choi, Tsan-Ming
    Jiang, Liping
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 146 (02) : 694 - 703
  • [8] Reducing truck emissions at container terminals in a low carbon economy: Proposal of a queueing-based bi-objective model for optimizing truck arrival pattern
    Chen, Gang
    Govindan, Kannan
    Golias, Mihalis M.
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2013, 55 : 3 - 22
  • [9] Managing truck arrivals with time windows to alleviate gate congestion at container terminals
    Chen, Gang
    Govindan, Kannan
    Yang, Zhongzhen
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 179 - 188
  • [10] A chassis exchange terminal to reduce truck congestion at container terminals
    Dekker, Rommert
    van der Heide, Sander
    van Asperen, Eelco
    Ypsilantis, Panagiotis
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2013, 25 (04) : 528 - 542