Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Baskett, K. Chandy, R. Muntz, Fernando Palacios, M. Chandy, F. Palaclos (1975)
Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJ. ACM, 22
(1986)
Flexible Manufacturing Systems: Operations ResearchModels and Applications, Elsevier, NewYork, NY
P. Legato (1993)
Approximate solution of a dynamic job shop model with several job classesEuropean Journal of Operational Research, 70
Vibhuti Dhingra, Govind Kumawat, D. Roy, R. Koster (2017)
Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operationsEur. J. Oper. Res., 267
P. Legato, R. Mazza (2001)
Berth planning and resources optimisation at a container terminal via discrete event simulationEur. J. Oper. Res., 133
I. Akyildiz, A. Sieber (1988)
Approximate Analysis of Load Dependent General Queueing NetworksIEEE Trans. Software Eng., 14
S. Bruell, G. Balbo, P. Afshari (1984)
Mean value analysis of mixed, multiple class BCMP networks with load dependent service stationsPerform. Evaluation, 4
R. Ramakrishnan, A. Krishnamurthy (2012)
Performance evaluation of a synchronization station with multiple inputs and population constraintsComput. Oper. Res., 39
Pietro Canonaco, P. Legato, R. Mazza, R. Musmanno (2008)
A queuing network model for the management of berth crane operationsComput. Oper. Res., 35
Raymond Marie (1979)
An Approximate Analytical Method for General Queueing NetworksIEEE Transactions on Software Engineering, SE-5
(1978)
Quantitative design tools for computerized manufacturing systems
D. Yao, J. Buzacott (1986)
The exponentialization approach to flexible manufacturing system models with general processing timesEuropean Journal of Operational Research, 24
M. Reiser (1981)
Mean-value analysis and convolution method for queue-dependent servers in closed queueing networksPerform. Evaluation, 1
(1997)
Diffusions approximation vonWarteschlangensystemen”, Ph.D. thesis, Technische Universität Clausthal
G. Bolch, S. Greiner, H. Meer, Kishor Trivedi (2005)
Queueing Networks and Markov Chains
M. Reiser, S. Lavenberg (1980)
Mean-Value Analysis of Closed Multichain Queuing NetworksJ. ACM, 27
(2000)
Corresponding author Pasquale Legato can be contacted at: legato@dimes.unical.it For instructions on how to order reprints of this article
G. Casale, M. Tribastone, P. Harrison (2014)
Blending randomness in closed queueing network modelsPerform. Evaluation, 82
D. Ivanov, S. Mason, R. Hartl (2016)
Supply chain dynamics, control and disruption managementInternational Journal of Production Research, 54
Y. Liu, H. Perros (1991)
A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing SystemIEEE Trans. Computers, 40
Özgecan Ulusçu, T. Altiok (2009)
Waiting time approximation in single-class queueing systems with multiple types of interruptions: modeling congestion at waterways entrancesAnnals of Operations Research, 172
C. Sauer, K. Chandy (1981)
Computer Systems Performance Modeling
B. Baynat, Y. Dallery (1993)
Approximate techniques for general closed queueing networks with subnetworks having population constraintsEuropean Journal of Operational Research, 69
P. Solot, J. Bastos (1988)
MULTIQ: A Queueing Model for FMSs with Several Pallet TypesJournal of the Operational Research Society, 39
D. Roy, Akash Gupta, R. Koster (2016)
A non-linear traffic flow-based queuing model to estimate container terminal throughput with AGVsInternational Journal of Production Research, 54
G. Graham (1978)
Guest Editor's Overview… Queuing Network Models of Computer System PerformanceACM Comput. Surv., 10
N. Goossens, A. Krishnamurthy, N. Vandaele (2007)
Approximations for fork/join systems with inputs from multi-server stations
G. Balbo, G. Serazzi (1997)
Asymptotic Analysis of Multiclass Closed Queueing Networks: Multiple BottlenecksPerform. Evaluation, 30
S. Balsamo, G. Iazeolla (1982)
An Extension of Norton's Theorem for Queueing NetworksIEEE Transactions on Software Engineering, SE-8
D. Roy, R. Koster (2015)
Stochastic modeling of unloading and loading operations at a container terminal using automated lifting vehiclesEur. J. Oper. Res., 266
R. Buitenhek, G. Houtum, H. Zijm (2000)
AMVA‐based solution procedures for open queueing networks with population constraintsAnnals of Operations Research, 93
K. Satyam, A. Krishnamurthy, M. Kamath (2013)
Solving general multi-class closed queuing networks using parametric decompositionComput. Oper. Res., 40
W. Zijm, I. Adan, R. Buitenhek, G. Houtum (2000)
Capacity analysis of an automated kit transportation systemAnnals of Operations Research, 93
K. Mani, Chandy Charles, H. Sauer, K. Chandy, C. Sauer (1978)
Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Comput. Surv., 10
IBM Journal of Research and Development, 1
S. Lam, J. Wong (1982)
Queueing network models of packet switching networks part 2: Networks with population size constraintsPerform. Evaluation, 2
J. Buzacott, J. Shanthikumar (1993)
Stochastic models of manufacturing systems
S. Lam, J. Wong (1981)
Queueing network models of packet switching networks
K. Satyam, A. Krishnamurthy (2008)
Performance evaluation of a multi-product system under CONWIP controlIIE Transactions, 40
Jing Jia, S. Heragu (2009)
Solving Semi-Open Queuing NetworksOper. Res., 57
J. Wong, S. Lam (1982)
Queuing network models of packet switching networks part 1: Open networksPerform. Evaluation, 2
P. Heidelberger, Kishor Trivedi (1983)
Analytic Queueing Models for Programs with Internal ConcurrencyIEEE Transactions on Computers, C-32
B. Baynat, Y. Dallery (2000)
An approximation method for general closed queuing networks with Fork/Join mechanismsJournal of the Operational Research Society, 51
Özgecan Ulusçu, T. Altiok (2013)
Waiting time approximation in multi-class queueing systems with multiple types of class-dependent interruptionsAnnals of Operations Research, 202
B. Dragovic, E. Tzannatos, N. Park (2017)
Simulation modelling in ports and container terminals: literature overview and analysis by research field, application area and toolFlexible Services and Manufacturing Journal, 29
Xiaojun Zhang, Qingcheng Zeng, Zhongzhen Yang (2016)
Modeling the mixed storage strategy for quay crane double cycling in container terminalsTransportation Research Part E-logistics and Transportation Review, 94
W. Whitt (1995)
Variability functions for parametric-decomposition approximations of queueing networksManagement Science, 41
E. Gelenbe (1975)
On Approximate Computer System ModelsJ. ACM, 22
B. Baynat, Y. Dallery (1996)
A Product-Form Approximation Method for General Closed Queueing Networks with Several Classes of CustomersPerform. Evaluation, 24
Erkut Sonmez, Alan Secomandi, D. Tepper (2009)
An Analytical Approximation for the Throughput of a Closed Fork/Join Network with Multi-Station Input Subnetworks
Michael Manitz (2015)
Analysis of assembly/disassembly queueing networks with blocking after service and general service timesAnnals of Operations Research, 226
U. Mitzlaff (1997)
Diffusions approximation von Warteschlangensystemen
D. Kouvatsos, J. Almond (1988)
Maximum entropy two-station cyclic queues with multiple general serversActa Informatica, 26
W. Whitt (1983)
The Queueing Network AnalyzerThe Bell System Technical Journal, 62
P. Legato, R. Mazza (2018)
A decision support system for integrated container handling in a transshipment hubDecis. Support Syst., 108
The use of queueing network models was stimulated by the appearance (1975) of the exact product form solution of a class of open, closed and mixed queueing networks obeying the local balance principle and solved, a few years later, by the popular mean value analysis algorithm (1980). Since then, research efforts have been produced to approximate solutions for non-exponential services and non-pure random mechanisms in customer processing and routing. The purpose of this paper is to examine the suitability of modeling choices and solution approaches consolidated in other domains with respect to two key logistic processes in container terminals.Design/methodology/approachIn particular, the analytical solution of queueing networks is assessed for the vessel arrival-departure process and the container internal transfer process with respect to a real terminal of pure transshipment.FindingsNumerical experiments show the extent to which a decomposition-based approximation, under fixed or state-dependent arrival rates, may be suitable for the approximate analysis of the queueing network models.Research limitations/implicationsThe limitation of adopting exponential service time distributions and Poisson flows is highlighted.Practical implicationsComparisons with a simulation-based solution deliver numerical evidence on the companion use of simulation in the daily practice of managing operations in a finite-time horizon under complex policies.Originality/valueDiscussion of some open modeling issues and encouraging results provide some guidelines on future research efforts and/or suitable adaption to container terminal logistics of the large body of techniques and algorithms available nowadays for supporting long-run decisions.
Maritime Business Review – Emerald Publishing
Published: Mar 3, 2020
Keywords: Simulation; Queueing; Application; Containers
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.