ࡱ> l>ooooooooLNXZBDNP$6$&02$&02<>BVXVX "NPdf02^`tvz| j]CJ j[CJ jCJU@CJ5CJ 5@<CJ@<CJ6CJ @CJmH CJP.02>@BXZ\^~,PRx:d$dd$*$  MODELLING OF PORT CONTAINER TERMINAL USING THE QUEUING THEORY Zdenka Zenzerovi Assistant Professor, Dept. of Maritime Studies, University of Rijeka Edna Mrnjavac Full Professor, Dept. of Maritime Studies, University of Rijeka The paper demonstrates application of the queuing theory in modelling a port container terminal. As a port container terminal is a complex system, it is possible to achieve operational efficiency of the terminal through coordination of particular subsystem capacities, i.e. determination of optimal terminal capacity accommodation. A port container terminal can be considered as a queuing system defined with basic parameters: the ship or container arrival rate and the ship or container service rate, in an observed time unit. Appropriate indices of port container terminal operations are computed on the basis of these parameters. A model of total ship waiting and berth unoccupancy costs has been established through the introduction of costs as optimization criteria thus facilitating decision-making on optimal capacity of a port container terminal. 1. INTRODUCTION A port container terminal is a complex system which, in relation to the technological process, consists of the following subsystems: the quay with one or more berths, stacking area for containers, traffic network for internal transportation and loading-unloading zone for land vehicles. Depending on anticipated traffic expressed in number of ships or containers which will be unloaded or loaded at the port container terminal during a planned period, it is necessary to determine the appropriate capacity resources for work and labour, i.e. capacity of all subsystems of the port container terminal. The efficient operation of a port container terminal is achieved through coordination of particular subsystem capacities and this can be facilitated through modelling a port container terminal using the queuing theory. In determining the optimal capacity of a port container terminal, maximum attention should be paid to the quay system with berths. The reason for this is that the accommodative capacity of the terminal, expressed in number of berths, determines the required capacity of the other subsystems of a terminal and, hence, the port container terminal capacity as a whole. The aim of this paper is to demonstrate how to monitor operations with the aid of the queuing theory model, i.e. how to determine the optimal capacity of a port container terminal. This paper is a continuation of the former published scientific and professional works considering the port system modelling. C. H. Plumlee (1996.) and S. R. C. Wanhill (1974.), in their papers ( ( and ( (, have described the method for determining the optimal number of berths on the basis of total ship waiting costs and berth unoccupancy costs. In his book ( (, G. Schulze (1977.) has presented solving of particular problems in connection with port activities, using quantitative methods. V. }iljak (1982.) has reviewed the port systems using simulation models ( (. Authors P. Schonfeld and S. Frank (1984.), in paper ( (, have showned the model of total port costs reffering to container ports with one berth, and in the paper ( ( of P. Schonfeld and O. Sharafeldin (1985.), the model, by which the optimal combination of berths and cranes per berth can be determined, was presented. The method for determining the berth optimal capacity is presented in paper of M. Noritake and S. Kimura (1983.) ( (. Same authors (1990.) in paper ( ( as well as K. G. Zografos and W. Martinez (1990.) in paper ( (, have reviewed the method for defining the optimal size of a port within the system of seaports. Through the development of computer technology to a large extent has influenced on application of simulation model of port system, in this paper mathematical models are chosen because of their advantages over simulation in terms of determination the most advantageous, i.e. optimal solution. It should be emphasize that, in former papers, assumption of number of ship arrivals and service time being random variables hadn't be examined, but only accepted. Also, interdependence of port system parameters and their influence to the system effectiveness, which has great importance in port planning, haven't been treated enough. Namely, knowing relations between the system elements, efficaciously functioning of port system can be achived by appropriate changes in model. 2. DEFINING A PORT CONTAINER TERMINAL AS A QUEUING SYSTEM A port container terminal is defined as a queuing system with the following structure: entrance units are container ships which form (or not) a queue (depending on the immediate situation) to be serviced (unloading or loading of containers) at the container berths (servicing channels), and leave the system when the service has been performed. The port container terminal as a queuing system is characterised by the following facts: It is not possible to anticipate the arrival time of ships at the terminal as it depends on route, speed of ship in knots, weather, organization of maritime transportation processes and other reasons. It is not possible either to accurately predict servicing time of the ship, i.e. duration of transshipment operations, as it depends on number and type of container, capacity and technology of transshipment facilities, weather, organization of port transshipment processes, etc. The consequence of these facts is the irregular berth employment. If the number of arriving ships is greater than the berth capacity, i.e. the number of ships which can be serviced by the existing berths within an observed time unit, then the ships appear in a queuing line or, conversely, if there are fewer ships, they do not have to wait, however, the berth capacity is not completely used. Through statistical data analysis on the number of ship arrivals per days and months of a chosen port container terminal, it has been established that no significant dependence exists in the sequence of daily arrivals of container ships, i.e. that ship arrivals are statistically random. An analogous conclusion is obtained by a statistical analysis of the service time duration of container ship. Strength and form of link among observed phenomena has been tested by a statistical method of correlation for data grouping (see more details in doctoral dissertation----z$; by Z. Zenzerovi [ , pp.47-54.], also in paper of I. `oai-V.Serdar [ , pp.131-136.] and in paper of M. R. Spiegel [ , pp.296-299.]. From the previous conclusion, it follows that the number of ship arrivals and duration of servicing time can be taken as random variables and, in addition, the empirical distributions of those variables approximated with the appropriate probability distributions, and finally, the queuing theory can be applied in such cases for computing indices of port container terminal operations. From the queuing theory viewpoint, a port container terminal has the following characteristics: seq level0 \h \r0 seq level1 \h \r0 seq level2 \h \r0 seq level3 \h \r0 seq level4 \h \r0 seq level5 \h \r0 seq level6 \h \r0 seq level7 \h \r0 A port container terminal is an open system as the ships are not a component part of the system. A port container terminal is a single or multichannel system (depending on the number of berths) and, in this connection, ships at anchorage form queues for particular berths. The number of ship arrivals as well as the duration of servicing time i.e. duration of ships stay on the berth are allocated according to certain probability distributions (most often according to Poissons or Erlangs distribution of the k-order, where k is a natural number). The servicing time of ship, together with the time spent queuing on the berth, represent the time of the ships stay at the terminal and is one of the more significant indices of port container terminal operations. As regards queuing discipline, a container terminal is a system where servicing is most often carried out according to the FIFO rule (first come-first served) but it is possible that there are certain ships which have priority in servicing. 3. DETERMINATION OF OPTIMAL BERTH NUMBERS IN A PORT CONTAINER TERMINAL It is necessary to define basic parameters for a port container terminal as well as any queuing system. These are: average number of container ships (or containers) which arrive at the terminal in an observed time unit and average number of container ships (or containers) which can be serviced in a same time unit at the terminal. On the basis of these parameters, appropriate indices of port container terminal operations can be computed and using the model of total queuing costs, decisions on optimal capacity of a port container terminal can be made. 3.1. Basic parameters of a servicing process at a port container terminal The basic parameters of a port container terminal are the ship arrival rate ( and the service rate ( . For a chosen container terminal system, parameter ( represents the average number of container ships or containers which arrive at a terminal during an observed time unit (e.g. during a year, month or day). It often happens in practice that data on the number of ships within a time unit are not available only the time which elapses between two consecutive ship arrivals. On the basis of these data, an arithmetical mean which represents the average interval between two consecutive ship arrivals ( EMBED Equation.2 ) is computed. This interval is, in fact, the reciprocal value of the ship arrival rate:  EMBED Equation.2 , or  EMBED Equation.2 . The service rate can be explained by the same analogy. For a chosen container terminal system, ( represents the average number of container ships or containers which can be serviced in a time unit at certain berth. If the number of ships which can be serviced during an observed time unit is unknown and only duration of service time per ship is known, then the arithmetical mean pattern represents the average service time duration per ship ( EMBED Equation.2 ) and this time is the reciprocal value of the service rate:  EMBED Equation.2 , or  EMBED Equation.2 . The parameter ( represents the accommodative capacity of one berth and multiplicant S ( ( , where S is the symbol for the number of berths, accommodative capacity of the container terminal as a whole. The arrival rate and service rate quotient represents the utilization factor or berth occupancy rate ( :  EMBED Equation.2 . If ( > ( , one berth is insufficient as the utilization factor is greater than 100%. In this event, the number of berths should be increased until the service system stability condition that the utilization coefficient of the system ( ( S < 1 has been satisfied. In practice, values of the parameters ( and ( are determined on the basis of empirical data or assessment depending on the goal and subject of research. 3.2. Operation indices of a port container terminal Based on a container terminal definition as a queuing system and on basic parameters of a terminal, operating indices of a port container terminal can be computed. These are: Berth occupancy rate (() , Container terminal utilization coefficient ((/S ) , Probability that there is no ship at the terminal, i.e. the berth is unoccupied (P0 ) , Probability that n ships are at the terminal, i.e. that n ships are just being serviced or are waiting in a queue to be serviced (Pn ) , Probability of servicing, i.e. the probability that a ship which arrives at the terminal will be serviced (Pserv) , Probability that all berths are occupied, i.e. that the ship will wait ( P( n(S ) ) , Average number of ships in queue (LQ ) , Average number of ships which are just being serviced (Lserv) , Average number of ships at the container terminal, i.e. number of ships in queue and number of ships which are just being serviced (L) , Average queuing time of ship, i.e. queuing time of ship before being serviced (WQ ) , Average servicing time of ship (Wserv) , Average time of ship's stay at the terminal, i.e. queuing time of ship and time of ship(s servicing (W) , Average number of unoccupied berths (S-() . Based on the queuing problem classification, the port container terminal is a system which permits an unlimited number of ships to wait in a queue, most frequently using Poisson's distribution for ship arrivals and time of ship servicing, i.e. with the symbol M/M/S/oo. Container terminal operation indices are computed according to the appropriate queuing theory formulae (see in [br],[ch],[gr],[k],[n] or in [z]). A change in the number of berths impacts on the increased or reduced values of particular container terminal indices: by an increase in the number of berths, the number of ships in the queue and at the terminal, as well as waiting time and length of ship's stay at the terminal, are reduced, but the berth unoccupancy is increased. Since the berth capacity determines the required capacity of other port container terminal subsystems and with this the entire accommodation container terminal capacity, the question of how to determine optimal number of berths, on the basis of indices of a port container terminal operations, may arise. A decision on the optimal number of berths of a port container terminal depends on previously set criteria of optimization, e.g. percentage of berth capacity utilization, ship's time spent in queue, number of ships in queue or ship waiting costs and berth unoccupancy costs, i.e. that criterion which is deemed the most significant for efficient operation of a container terminal have to be chosen. The efficiency of the port container terminal, which is very often in practice determined by operating indice W , is augmented either with an increase in the number of berths or with curtailment of average servicing time of the ship. However, a growth in the number of berths increases the probability that berths will be vacant which, in turn, means that berth unoccupancy will go up. Similarly, a curtailment in ship service time may affect the quality of service in a negative way thus reducing the number of ship arrivals. That is why the container terminal efficiency can best be determined through the introduction of value indices, i.e. by means of the costs since, in practice, a ship's waiting time has to be paid for and the unoccupancy of the berth can also be expressed in terms of value. 3.3. Queuing cost model of a port container terminal As with all queuing systems, ship waiting line is notified at the container terminal before the beginning of loading/unloading operations or "waiting", i.e. berth container unoccupancy when there are no ships waiting to be serviced at the terminal. In order to eliminate waiting at the port container terminal, a great number of berths would have to be constructed to obviate the need for waiting or as many berths which would be permanently employed so that they do not remain unoccupied. These extreme solutions, of course, are not rational, as elimination each participant's waiting period leads to maximum waiting of a second participant in the queuing system. Due to random arrivals of container ships at the terminal as well as duration of ship service which is also a random variable, from a queuing theory viewpoint, it is not possible in practice to implement such work organization at the port container terminal so that at any one moment the berth capacity is 100% employed and at any one moment a ship arriving does not have to wait for beginning of loading/unloading operations. Since in practice the waiting time and the berth unoccupancy cannot be completely avoided, each terminal strives to reduce waiting time as much as possible, i.e. costs of both participants in the servicing process at the container terminal to carry to a minimum amount. Total waiting costs can be observed separately: costs from the shipowner's viewpoint and from the container terminal viewpoint. A clash of interest exists between the shipowner and the container terminal: it is in the shipowner's interest to have the ship wait as short a period as possible and in the port container terminal interest to handle as much traffic as possible in an observed time unit with the least number of berths. Nevertheless, the servicing process at the container terminal should be resolved taking into consideration total waiting costs as the interests of both, shipowner and port, are mutually interwoven: the port container terminal is not indifferent to the long waiting time of the ships even through it has high berth utilisation, as this waiting is expensive and can divert the ships to other ports; in the event of a short waiting time, the supposition is that the container berths are poorly employed and this may result in an increase of port service costs, which, in turn, is not in the shipowner's interest. If costs are taken as optimization criteria, then the servicing process solution at the container terminal will represent the optimum number of berths for which total expenses of ship waiting time and expenses of berth unoccupancy are minimum in an observed unit of time. In this regard, the optimal variant will be that one which will reduce to a minimum losses resulting from waiting. The total queuing costs C include: ship queuing costs Cw , and berth unoccupancy costs Cb . Total ship queuing costs and berth unoccupancy costs are computed as follows: Ship queuing costs  EMBED Equation.2 , (1) Unoccupied berth costs  EMBED Equation.2 , (2) Total queuing costs  EMBED Equation.2  (3)  EMBED Equation.2 , where: C - is the amount of total costs expressed in currency units in an observed time unit (example:in USD/hour), LQ - is the average number of container ships in the queue, S - is the number of container berths, ( - is the berth occupancy rate; ( = (/( , t - is the length of time period for which costs are computed (e.g. day, month, year), cw - is the amount of costs caused by waiting of ship, expressed in currency units for an observed time unit (e.g. in USD/hour/ship), cb - is the amount of costs arising from unoccupancy of berth, expressed in currency units for an observed time unit (e.g. in USD/hour/berth). Since container traffic is expressed in TEU and not in number of ships, and a cost unit cw relates to the container ship queuing cost unit, it is necessary that LQ is converted into the number of ships taking into consideration the number of containers which, on average, are loaded/unloaded at the terminal. From the queuing theory, it is known that:  EMBED Equation.2  (4)  EMBED Equation.2 , (5) so that total cost function can be written in the form:  EMBED Equation.2 , (6) or, if is taken into consideration that  EMBED Equation.2  i.e.  EMBED Equation.2  formula (3) assumes the form:  EMBED Equation.2 , (7) where WQ is the average time of ship spent in the queue. Model of ship queuing costs and berth unoccupancy costs, or total queuing model costs is applied in such a manner that utilising formulae (3), (6) or (7), the amount of ship queuing costs and berth unoccupancy costs for a certain number of container berths are computed; then, through a change in the number of berths, the service process at the container terminal is programmed and on the basis of the results obtained for various values of berth numbers, the optimal number of berths can be determined, i.e. the number of berths for which the amount of total queuing costs is minimal. The model of total queuing costs shown can serve as a basis for making appropriate business decisions during analysis of existing employment capacity or planning the development of future port container terminal capacity. 4. CONCLUSION The port container terminal is a complex system composed of several subsystems: the quay with berths, stacking area for containers, traffic network for internal transportation as well as loading and unloading zone for land vehicles. So as to facilitate operational efficiency of the port container terminal, it is necessary to coordinate mutually the capacity of all subsystems in such a manner that exit from one subsystem represents entry to the following subsystem. This is possible to achieve through determination of the optimal number of port container terminal berths using the queuing theory. The port container terminal is a queuing system for which the appropriate indices can be computed, e.g.: the probability of berth unoccupancy, anticipated number of ships in the queue, waiting time of ship, etc. On the basis of those indices and through the introduction of costs as optimization criteria, a model of total ship waiting costs and berth unoccupancy costs has been fixed. It is possible with this model to determine the optimal number of berths and, based on that result, to calculate the required capacity and the other subsystems of the port container terminal. LITERATURE ( 1( Berth Throughput, Systematic Methods for Improving General Cargo Operations, United Nations, TD/B/C.4/109 and Add.1, New York, 1973. ( 2( Bronson, R.: Operations Research, McGraw-Hill Book Company, 1982. ( 3( Chang, Y.L.-Sullivan, R.S.: Quantitative Systems for Business Plus, Version 1.0, Prentice-Hall, 1988. ( 4( eri, V.: Modelling by Simulation, `kolska knjiga, Zagreb, 1993. (in Croatian) ( 5( Frankel, G.E.: Port Planning and Development, John Wiley and Sons, New York, 1987. ( 6( Gross, D.-Harris, C.M.: Fundamentals of Queueing Theory, John Wiley and Sons, New York, 1974. ( 7( Kaufmann, A.: Mthodes et models de la recherche oprationnelle, Tome 1, Dunod, Paris, 1970. ( 8( Kirin i, J.: Ports and Terminals, `kolska knjiga, Zagreb, 1991. (in Croatian) ( 9( Miller, A.J.: Queueing at Single-Berth Shipping Terminal, Journal of the Waterways, Harbors and Coastal Engineering Division, ASCE, Vol.97, No.WW1, February 1971, pp. 43-56. (10( Mrnjavac, E.-Zenzerovi, Z.: Model for Determining the Optimum Number of Berths of a Port Container Terminal, Proceedings of the 6th International Symposium on Electronics in Traffic, ISEP (97, Elektrotehnika zveza Slovenije, Ljubljana, pp. 149-156. (11( Newell, G.F.: Applications of Queueing Theory, Chapman and Hall, London, New York, 1982. (12( Noritake, M. - Kimura, S.: Optimum Number and Capacity of Seaport Berths, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.109, No.3, August 1983, pp. 323-339. (13( Noritake, M. - Kimura, S.: Optimum Allocation and Size of Seaports, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.116, No.2, March/April 1990, pp. 287-299. (14( Port Development, A Handbook for Planners in Developing Countries, United Nations, New York, 1978. (15( Port Development, United Nations, TD/B/C.4/175/Rev. 1, New York, 1985. (16( Plumlee, C.H.: Optimum Size Seaport, Journal of the Waterways and Harbors Division, ASCE, Vol. 92, No. WW3, August 1966, pp. 1-24. (17( Schonfeld, P. - Frank, S.: Optimizing the Use of a Containership Berth, Transportation Research Record, 984, January 1984, pp. 56-62. (18( Schonfeld, P. - Sharafeldien, O.: Optimal Berth and Crane Combinations in Containerports, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.111, No.6, November 1985, pp. 1060-1072. (19( Schulze, G.: Modellierung hafen-betrieblicher Prozesse, Transpress, Berlin, 1977. (20( Spiegel, M.R.: Probability and Statistics, Schaumovinj, September 30.- October 2. 1998., Hrvatsko druatvo za operacijska2 s outline Series in Mathematics, McGraw-Hill Book Company,1980. (21( `oai, I.-Serdar, V.: Introduction to Statistics, `kolska knjiga, Zagreb, 1997. (in Croatian). (22( Wanhill, S.R.C.: Further Analysis of the Optimum Size Seaport, Journal of the Waterways, Harbors and Coastal Engineering Division, ASCE, Vol. 100, No. WW4, November 1974, pp. 377-383. (23( Weille, de J. - Ray, A.: The Optimum Port Capacity, Journal of Transport Economics and Policy, Vol.VIII, No.3, September 1974, pp. 244-259. (24( Zenzerovi, Z.: Optimization Models of Planning Seaport Capacities, Doctoral Dissertation, University of Rijeka-Faculty of Economics , Rijeka, 1995.(unpublished, in Croatian). (25( Zografos, K.G.-Martinez,W.: Improving the Performance of a Port System through Service Demand Reallocation, Transportation Research-B, Vol. 24B, No.2, 1990., pp. 79-97. (26( }iljak, V.: Simulation by computers, `kolska knjiga, Zagreb, 1982. (in Croatian).  ~6PC F W x y y 12vwxy~8:<>"#$%fjmhi!p#q###########j@CJUmH @CJCJCJmH j] j[mH5@CJmH 6@CJmH CJmH  5CJmH  @CJmH JL~46RC D E F X Y y $*$ 0$*$ 0 $$*$ 0 $$$*$ 0$*$$*$?#"r"$rL~46RC D E F X Y y 2fjklno8O! #o#p#q$!%'(((-(N(P(}*~****7+ ,---./ 0!0½ D}WX$!bc    !   !     $!#"Ay 2fjklno8O! #o#p#$*$  $ & F*$  $ & F*$ $*$ 0$$!! 0#####$$q$&& &!&'(-(N(**++0+2+3+7+k+l+ ,.-/-B-C-D-E-------------7.8.//{j"@CJEHUmH jBU/< UVhmHnHj@CJEHUmH j0U/< UVhmHnHj@CJEHUmH jcL; UVhmHnH jl jm@CJmH  jl@CJmH 5@CJmH 6j@CJUmH  @CJmH 0p#q$!%'(((-(N(P(}*~****7+ ,---.$*$ !$*$ $*$  $*$  ! & F h ! & F  $ & F*$ //////////00000001020y0{0|0}0~0000V1W1Z1[1n1o1p1q1y1Ÿ}obj @CJEHUmH j[U/< UVhmHnH jr j@CJmH 6@CJmH  jm@CJmH jm @CJEHUmH jUU/< UVhmHnHjA@CJEHUmH jPU/< UVhmHnHj@CJUmH jM@CJEHUmH jL; UVhmHnH @CJmH #./ 0!00Z1s1t12333T3U344!4V449556/6q6$ & F*$ 8!h ! !$*$ $*$ !00Z1s1t12333T3U344!4V449556/6q66R7|7788&99;8<=@ǿwolifa\YT!e!'!tF      2      (      ~        ( !)!!= y1z1}1~1`2a2b2c2d2e22222 3S3U3444N4O4P4Q44444444253545555555555(6)6*6g6h6l666K7L7M7s7t7x77777 8888ɷɷɷɭɷɷɷɷ j@CJmH  j@CJmH 6@CJH*mH 5@CJmH 6@CJmH  j@CJmH  jr@CJmH  jm@CJmH  @CJmH  jl@CJmH @q66R7|7788&99;8<=@@@#A$ABCzFJK9L! V $*$ !$*$ $*$8 8$ & F*$ 889999 9!998<=8>9>@@"ACzFHHJKK-L.LNLOLPLrLsLtLLLLLLLLLLMMM%M&M'M(M*M.MCMDMEMXMYMZM[M\Mؾjs3@; EHUjs3@; UVmHnHjt3@; 5EHUjt3@; UVmHnH j5U5CJju3@; EHUju3@; UVmHnH jU6@CJH*mH 5@CJmH 66@CJmH  @CJmH 7@@@#A$ABCzFJK9L:LYLwLxLLLLLM.M/MCM`MzMMM*NRN~NN]OOO#Q$QPQmQQQQQQ_R}RRRþ|yv2m&'_}lip!"#rs    !!m  @AB.9L:LYLwLxLLLLLM.M/MCM`MzMMM*N$*$V $*$V B $dh  dh  9! dh 9!! $*$  $ & F*$8 h8$*$ \M`MaMbMuMvMwMxMyMMMMMM*N+NRNSNtNuNxNyNzN{N~NNNNN]O^O_OFPGPHPPPPPQQQRQeQfQgQhQmQnQoQQQQQܶܬ jEHUjW/< UVhmHnHjq3@; EHUjq3@; UVmHnH jm@CJmH  jl@CJmH  jr@CJmH 6@CJH*mH 6@CJmH  @CJmH jr3@; EHUjr3@; UVmHnH jUCJ3*NRN~NN]OOO#Q$QPQmQQQQQQ_R}RRRUU dh 9! dh 9! dh 9!$*$ $*$V $*$V QQQQQQQQQQQQ R R R!R"R#R$R(R)R*R=R>R?R@RAR_R`RaRtRuRvRwRyR|RRRRSSUUZZZZZ~x j[CJ@mH 5@CJmH 6@CJH*mH 6@CJmH  j5EHUj XZ< UVhmHnHjm3@; EHUjm3@; UVmHnHjn3@; EHUjn3@; UVmHnH jEHUjWZ< UVhmHnH jU @CJmH CJ/RUUUUUUUUVSXZZZZZZZ0[w[[\R]^^_`vbbcMddeeff^^^^^^_*______`````0aaaa8b9bvbwbybzbbbbbbbb!cccccccMdNdPdQdRd jCJCJH*@CJ j[CJ6CJCJ j]CJXbcMddeeff0Dd[B  S A? 2ms"SVv6`!nms"SVx`SH<xJPsM:TB}lI0B@iKl>ɧp8 {M2ojsL-YcSz2(J)QiG6Ss5]c4aU?\u)Ջw춗cSBєȦ6#6uRhN]M1cɰd'0&ywhƛ6#RfP~j_ YSzһ1FWX<ӛa\cjޞLeցcژ5>>Z7j17$KR,\~DX+Dd[B  S A? 2cf^ ދgEXt f!TEuSak-DkE٣MQLwхlB ,DOt Z pW­d%G֌Ԇ4fw.ޖf"Giߏi֥L9 I0Dzu$κY:R/3VlL 5gl/ruI~vJf1 :}<>SDdTB  S A? 2^ jtG'%N:`!2 jtG'%N hXJxQJQ=s|@6F%4`c)ֈ(?B k/rpιg Z'-XhhhY">}/>946sPD7E}Watp2nӻ , ~V}qO{׸tY&Xe~I1&E0ƭ0n<_zo孹ח uLB"ar ??z,DdB  S A? 2U>=yZɪ`cf=r`!jU>=yZɪ`cf=zH8xJPsM: uB_@[pn!hZ1A&N:e}sL 'w 6asu1(J)Qi[.Snr5 oUw;KkX2CX35SS|(=fW7)N{dmšt{)Ϯr ]~#l`8J6<ƣ 0d=>mxS\2B(%+'Qc j,O/UKTu{xGͰp.yu5|9[R0' K(Ƽ/CZ+DdB  S A? 2CZ-hUaq `!iCZ-hUaJH7xJ@4ŦUV ](o-M+&Tr{Ƀx;x'(zUp]ԃn0w?3m~a |k,QEo&2 R(a6ˮW]'4tU] aAT_Pݝ5p{u t4%]-sYjIjjΜVPRw^~n FW`#s^СuHJr@a%witF'?M_,E3ؓ }-VA(i|3>7e8eSbnu4Lz&@SDd B  S A? 2Q%nXš D\3- `!%%nXš D\3nHxMP;A}U=.:n mP &y-6=l0'cۮQ즚ׯ^jB0pʐqcLVyeJy@IPtY륄 !M!S>}+cw4Sj6UyO}# ovyG kIU5 ~R@ Nt0<]/#17z3pX89%S 1UDdB   S A ?  28o9u̿`!8o9u̿D@2xKP]ڤ?,łc :TQpp,bY!`b (?Ap(8VP..Q6w8M|r߻ch@HQAƈ0m*[$LEGE|$Ba> Oh+'0  8 D P \hpxQUEING THEORYoUEIOdjel Tdje Normal.dotRPomorski fakultet u Rijeci10oMicrosoft Word 8.0 @ X8 @;^@Xxݚ^@>&Bdb70Templates@O :i+00/C:\՜.+,D՜.+,H hp  Odjel za pomorstvo2x  QUEING THEORY Title 6> _PID_GUIDAN{309CD322-8C51-11D3-9237-0040951C6520}O :i+00/C:\_1002523747'F@SR^ dR^Ole CompObjfObjInfo !$)+,-./01247:<=>?@ABCDEFHKNPQRSTUVWXYZ[\^abeghijklmnopqrstvyz}ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jJ$DiJhiJpnJ 2t arr ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>Equation Native @_1009734960. FJuR^JuR^Ole CompObj fObjInfo Equation Native  \_1009734978FR^R^Ole  ࡱ> j@755 2t arr =)1lࡱ> ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j@6o+o+ l=)12t CompObj fObjInfoEquation Native \_1002523776FR^R^arrࡱ> ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jJ$DiJhiJpnJ 2t servࡱ>  FMicrosoft Equation 2.0 DS EqOle CompObjfObjInfoEquation Native @_1009734992"F|R^|R^Ole CompObjfObjInfouation Equation.29qࡱ>ࡱ> j@?7w6w6 2t serv =)1mࡱ> ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jEquation Native \_1009734997FER^ER^Ole CompObj fObjInfo!Equation Native  \_1009735003Q$FR^R^Ole "@G955 m=)12t servࡱ> ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j 633 r=)lmࡱ> |~LNRTvx|~jtv       FPRHRT5@CJH*mH  @CJmH  j]CJ j[CJCJ5Olenfo 'PICion Native (+(LMETA34978 F*0CompObj*,3fLU {hࡱ> jU {  .1  @` &  & MathTypepTimes New Romanr- 2 `4C 2 `c 2 `L 2 `ti Times New Romanr- 2 <w 2 Zw 2 QSymbol- 2 `l= 2 `\` 2 `` & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j HqJlJ$rJ C w =c w L Q tࡱ>NPRJLNPRT$*$ ࡱ> L ࡱ> j  u .1  ` & ? & MathType`Symbol-2 (Symbol-2 R )Times New Romanr-PIC734992 /2F9LMETA ;CompObj13GfObjInfo4I0  2 4C 2 uc 2 S 2  ti Times New Romanr- 2 .bp 2 bpSymbol- 2 ;= 2 ` 2 ?- 2  `Symbol- 2 lr & "System-r ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j LqJlJ$rJ C b =c b S-r()tࡱࡱ> Ln ࡱ> jn  .0 stvenoj i stru noj literaturi o META  Op CompObj&'()*+,-./08:56789]f@ObjInfoFGHIJKLMNOP;UVWXY_`Equation Nativeknpoq vxwy{`1  &`_ & MathTypepSymbol-2  (Symbol-2 )Times New Romanp- 2 4C 2 c 2 LL 2 ti 2  c 2 Z S 2 ti Times New Romanp- 2 w 2 Q 2 ^ bpSymbol- 2 = 2 ` 2 -` 2 + 2 = ` 2  - 2 C`Symbol- 2 r & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j llJqJmJ C=c w L Q t+c b S-r()tࡱ> jࡱ> L N< ࡱ> j N  .1  `& |~LNRTvx|~jtv       FPRHRT NR\^5@CJH*mH  @CJmH  j]CJ j[CJCJ= & MathTypeSymbol-2 p (Symbol-2 <)Symbol-2 >[Symbol-2 >]Times New Romanr- 2 4C 2 ti 2 c 2  L 2 ' c 2  S Times New Romanr- 2 `Sw 2 `Q 2 ` bpSymbol- 2 = 2 ` 2 U` 2  + 2 ) -Symbol- 2 Vr & "System- FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jNPRJLNPRT  TVXZ\^d$*$  pqJlJrJ C=tc w L Q +c b S-r()[]ࡱ> jࡱ> L ࡱ> j   .1  @ &@ Ole  { PICObj&'()*+,-./0 DG56789|L@METAfoFGHIJKLMNOP UVWXY~`CompObjNativeknpoqFHvxwy{f & MathTypeLSymbol-2 (LSymbol-2 x )Times New Romanr- 2 XL 2 \n 2 S 2  P Times New Romanr- 2 )Q 2  np 2 np 2 SpSymbol- 2 g= 2 l- 2 ( ` Symbol- 2 %={ 2 B+{ 2 Symbol- 2  Times New Romanr- 2 1p & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jObjInfo47IFEquation Native _1009735622LFUFR^UFR^fOlenfo  hqJlJ$rJ L Q =n-S()P nn=S+1 ࡱ> jࡱ> L ࡱ> j & .1  @&@PIC  KNL METAbj&'()*+,-./0 56789T@CompObjFGHIJKLMNOPMOUVWXYf`ObjInfoNativeknpoqPvxwy{ & MathTypeSymbol-2 ,(Symbol-2 )LSymbol-2 (LSymbol-2 y )Times New Romanr- 2 S 2 iS 2  n 2  P Times New Romanr- 2  np 2 (np 2 SpSymbol- 2 - 2 = 2  - 2 ) ` Symbol- 2 ={Symbol- 2 Symbol- 2 r Times New Romanr- 2 00p & "System-ࡱ>  FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jԀ6g6g6 S-r()=S-n()P nn=0S ࡱ> ࡱ> LEquation Native _1012553727JfSFWR^@F`R^Ole PICObj RULࡱ> j  .1   &< & MathTypeLSymbol-2 (LSymbol-2 0 )LSymbol-2 (LSymbol-2 #)Times New Romanr-METAfo CompObjNativeTVfObjInfo03WFEquation Native  2 4C 2 ~c 2  n 2 Q S 2  P 2 ic 2 S 2 \n 2 P 2 Xti Times New Romanr- 2 W 2 Qnp 2 bp 2 np 2 OSp 2 np 2 Sp 2 DnpSymbol- 2 = 2 W` 2 $ - 2  ` 2 G+ 2 ;- 2 ` 2  2  2  2  2  2  2 ` Symbol- 2 Q={ 2 o={ 2 +{ 2 Symbol- 2  2 ] Times New Romanr- 2 0p 2 1p & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> jG'677 C=c w n-S()P n +c b S-n() n=0S  n=S+1  P n []t0 stvenoj i stru noj literaturi o ࡱ> L{hࡱ> j{ . .1  @& & MathTypepTimes New Romanr- 2 `W9 2 `L Times New Romanr- 2 AQ 2 QSymbol- 2 `=Times New Romanr- 2 `/iSymbol- 2 `l & "System-ࡱ> FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ࡱ> j0 stvenoj i stru noj literaturi o a  4qJlJ$rJ W Q =L Q /lࡱ> ࡱ> L!{hࡱ> j!{  .1  @`&  & MathTypepTimes New RomanpOleObj PICnfo `cLMETAon Native ,CompObj76bdFf- 2 `XL 2 `DW9 Times New Romanp- 2 )Q 2 iQSymbol- 2 `g= 2 ``Symbol- 2 `l & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>ObjInfoNativeeEquation Native FP_1012553740hFBR^ 㡍R^LOle ࡱ> j 4lJqJmJ L Q =lW Qࡱ> ࡱ> LN ࡱ> jN  .1   &PIC734992 gjFLMETA CompObjikfObjInfol    & MathTypeSymbol-2  (Symbol-2 )Symbol-2 >[Symbol-2 >$]Times New Romanr- 2 4C 2 Mc 2 ]W9 2  c 2 m S 2 \ti Times New Romanr- 2 `W 2 `Q 2 `q bpSymbol- 2 = 2 &` 2 ` 2  + 2 P ` 2 - 2 `Symbol- 2 l 2 r & "System-ࡱ FMicrosoft Equation 2.0 DS Equation Equation.29qࡱ>& [0@0Normal1$ hmH nH R@R Heading 1$$*$0@& 5@CJmH V`V Heading 3$$1$7d@&5@<CJhmH nH<A@<Default Paragraph Font0+0 Endnote TextCJ6*@6Endnote ReferenceH*22 Footnote TextCJ8&@!8Footnote ReferenceH*>>TOC 1*$0 $ mH ::TOC 2*$0 $ mH ::TOC 3*$p0 $ mH ::TOC 4*$@ 0 $ mH ::TOC 5*$0 $ mH 66TOC 6*$0 $mH ..TOC 7 *$0mH 66TOC 8*$0 $mH 66TO"[Bbt 7~:J$F~' |(f̴a\` D:F?]{M(}nWWқXs{뛘)7Ǡ }2YOb uS&$|I" iLz+~/yTQt7q9/irMBsÑ;o^vCʥ漅47f:io`=P?k|' 'ѠS*SI  p'!fjʹ`uQF DdB  S A?  2`_ JvDfY`!^`_ JvD @ *,xOhAƿIf "x j&VMRlBJ/BCЋ[[-ͺofwMq޼!pAWԻ㜞"qu%F%W'xKHf{ \2~v1$wI9֤9 9 .? Ʃ_>I#jӘڇ>|Žv~3-??R`\"%'T9˦=bAFKM\U1$@&mq~#[^)9y4*ADd B  S A? 28?qfGǮ/y`!8?qfGǮ/x@CxKP}iA $nA[)(mb+nE nBИ%Kx{{yg=z$$LӔd, ժB.ڈ5d{|5+BLWR(!bQCe.,;bƩ]i)ؠKfߎt7N}o@Aϲ\qC\3eDϖc[jl @D4C&Gxt4VM! 3IMcRAN3Mٝo֚xur228*J'Lx|!~7PU&5$ޣɍ5Ibrfrw]'B=1 HD\h#uKࡱ> jliC 9*$0 $ mH > >Index 1*$` $ mH > >Index 2*$0 $ mH :.: TOA Heading *$ $mH &"&CaptionCJ2O2_Equation Caption@B@@ Body Text!$*$  @CJmH 4>@"4Title"$*$5@CJmH :J@2:Subtitle#$*$5@CJmH DP`BD Body Text 2 $$1$CJhmHnHTR`RTBody Text Indent 2 %1$CJhmH nHaw2 oq,,T-- .J../m//0/020@113Q45999=9>98:;>BCSDTDsDDEESQT UoUWXX=\\f^__!`1`2`P`Q`R`]`^`_```p`````aa!aYaZamaaaabbb(bxbybzbbbbbb/cRTVXZFHJLNP(*,.02(*,.$0$*$ e's outline Series in Mathematics, C. H. Plumlee (196C et modeles de la recherche oprationnelle, Tome 1, Dunod, Paris 1970. 25. Newell, G.F.: Applications of queueing theory, Chapman and Hall, London, New York 1982. 34. Schulze, G.: Modellierung hafen-betrieblicher Prozesse, Transpress, Berlin 1977. 59. }iljak, V.: Simulacija ra unalom, `kolska knjiga, Zagreb 1982. 61. xxx: Berth throughput, Systematic methods for improving general cargo operations, United Nations, TD/B/C.4/109 and Add.1, New York 1973. 64. xxx: Port development, A handbook for planners in developing countries, United Nations, New York 1978. 65. xxx: Port development, United nations, TD/B/C.4/175/Rev. 1, New York 1985. 84. Chappell, D.: A note on the optimal handling capacity at a berth, Maritime Policy and Management, 1979, 6, pp. 69-71. 85. Chappell, D.: Provision of Optimal Cargo - Handling Facilities at a Berth, Maritime Policy and Management, 1990, Vol.17, No.2, pp. 99-106. 94. Easa, S.M.: Approximate queueing models for analyzing harbor terminal operations, Transportation Research-B, 1987, Vol.21B, No.4, pp. 269-286. 95. Fratar, T.J. - Goodman, A.S. - Brant, A.E.: Prediction of Maximum Practical Berth Occupancy, Transactions, ASCE, Part IV, Vol.126, 1961, pp. 632-643. 96. Griffiths, J.D.: Optimal handling capacity at a berth, Maritime Studies and Management, 1976, No.3, pp. 163-167. 97. Griffiths, J.D.: Optimal handling capacity at a berth - A note, Maritime Policy and Management, 1976, Vol.4, No.2, pp. 121. 98. Hatzitheodorou, G.C.: Container port gate design by Queueing Theory, The Dock and Harbour Authority, Vol.LXII, No.734, January 1982, pp. 247-248. 111. Mettam, J.D.: Forecasting Delays to Ships in Port, The Dock and Harbour Authority, Vol.47, No.558, April 1967, pp. 380-382. 112. Miller, A.J.: Queueing at Single-Berth Shipping Terminal, Journal of the Waterways, Harbors and Coastal Engineering Division, ASCE, Vol.97, No.WW1, February 1971, pp. 43-56. 118. Noritake, M. - Kimura, S.: Stochastic Models to analyze Ships Activities in Seaport, Technology Reports of Kansai University, Vol.21, Osaka, Japan, March 1980, pp. 179-197. 119. Noritake, M. - Kimura, S.: Optimum Number and Capacity of Seaport Berths, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.109, No.3, August 1983, pp. 323-339. 120. Noritake, M. - Kimura, S.: Optimum Allocation and Size of Seaports, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.116, No.2, March/April 1990, pp. 287-299. 125. Pogny, T.: On the parameter shift influence to the total waiting time in the M/M/S/SYMBOL 165 \f "Symbol" queueing system, I, Proceedings of the 16th International Conference on ITI SYMBOL 162 \f "Symbol"94, Pula 1994., str. 391-395. 126. Pogny, T. - Zenzerovi, Z.: On the parameter shift influence to the total waiting time in the M/M/S/SYMBOL 165 \f "Symbol" queueing system, II, Proceedings of the 16th International Conference on ITI SYMBOL 162 \f "Symbol"94, Pula 1994., str. 397-402. 130. Schonfeld, P. - Frank, S.: Optimizing the Use of a Containership Berth, Transportation Research Record, 984, January 1984, pp. 56-62. 131. Schonfeld, P. - Sharafeldien, O.: Optimal Berth and Crane Combinations in Containerports, Journal of the Waterways, Port, Coastal and Ocean Engineering, ASCE, Vol.111, No.6, November 1985, pp. 1060-1072. 147. Weile, de J. - Ray, A.: The Optimum Port Capacity, Journal of Transport Economics and Policy, Vol.VIII, No.3, September 1974, pp. 244-259. Na kraju Uvoda dodati sljedei tekst: Ovaj rad je nastavak dosadaanjih radova objavljenih u znanstvenoj i stru noj literaturi o modeliranju lu kog sustava. C.H. Plumlee (1966.) i S.R.C. Wanhill (1978.) opisali su u svojim radovima ( ( i ( ( metodu odreivanja optimalnog broja lu kih pristana na tem0c1cAcucvcwccdddsdtd}dddd@eReeeeeffffgggxgygggghhhhii)iiiijjj?k@k`kkklllmmnnnn[o\oyoooooopppppprtstOwPwQwRwSwbw$ H  H  H  H  H  H  H  H  H  H  H H H H !H !H H !H H H H H H H !H H !H H H  H  H  00&P P. A!"#$%........()()()'s outline Series in Mathematics, elju troakova nezauzetih pristana i troakova brodova. G. Schulze (1977.) u knjizi ( ( prikazao je rjeaavanje pojedinih problema u svezi s lu kom djelatnosti, a koji semogu rijeaiti uz pomo modela. V. }iljak (1982.) lu ke sustave analizira primjenom simulnoporotovoxozo|o~ooooooooooooooooooPRd$*$ acijskih modela. Autori P. Schonfeld i S. Frank (1984.) u radu ( ( predlo~ili su model ukupnih lu kih troakova koji se odnosi na luke s jednim pristanom, dok u radu ( ( P. Schonfeld i O. Sharafeldin (1985.) predla~u model kojim se mo~e odrediti optimalna kombinacija pristana i dizalica po jednom pristanu. M. Noritake i S. Kimura (1983.) u radu ( ( prikazali su metodu odreivanja optimalan kapacitet pristana. Isti autori (1990.) u radu ( ( kao i K.G. Zografos i W. Martinez (1990.) u radu ( ( prezentira #/y18\MQZRdo|^HLNQSVX[]_y p#.q69L*NUbnoR.<jN^IKMORUWZ\^af!0@RoJPTYUnknownPomorski fakultet u Rijeci*I%]%_%%%%%%%'''((("(6(8(u)))D E E+E?EAE^ErEtE{EEEkIIIIIIIII&J:J111111111111155+EBE^EuEEEkIIIIII&J=JCJZJzJJXX^___1`SwTwTwVwVwWwWwXwYw[w\w^w_wbwPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdh+q p    zl [ 5? /" r.% $G1' g"( t;%) 4, VQ7 1111111111155ETU.U/U0U1UVWXXs\u\\\s]^_t___1`2`2a2c2dd?e@ee.lm.mmm-o[ooooopppp%pUpuppstttuuSwTwVwWwXwYw[w\w^w_w`waw00 @11@1li su metodu odreivanja optimalne veli ine luke unutar sustava morskih luka. Premda je razvoj ra unalske tehnologije u velikoj mjeri utjecao na primjenu simulacijskih modela lu koga sustava, u ovom radu odabrani su matemati ki modeli, zbog njihovih prednosti u odnosu na simulaciju s obzirom na odreivanje najpovoljnijeg, tj. optimalnog rjeaenj. Valja naglasiti da se u dosadaanjim radovima nije ispitivala, ve automatski prihvaala pretpostavka, da su broj dolazaka brodova i vrijeme trajanja usluge slu ajne varijable. Takoer, nije dovoljno obraena meuzavisnost parametara lu kog sustava te njihov utjecaj na efikasnost sustava, ato je vrlo va~no u planiranju luka. Naime, poznavajui odnose izmeu elemenata sustava, mogue je odgovarajuim promjenama u modelu postii efikasno funkcioniranje luke. C. H. Plumlee (196C & [0@0Normal1$ hmH nH R@R Heading 1$$*$0@& 5@CJmH V`V Heading 3$$1$7d@&5@<CJhmH nH<A@<Default Paragraph Font0+0 Endnote TextCJ6*@6Endnote ReferenceH*22 Footnote TextCJ8&@!8Footnot1@11@111<1 11$@11H$@11$%@11@'@11'@1 0(@1 1$1* 1(14 1 1*1 1.1 101 140 0D@1G@1.G@1VG@1~G@1G@1G@1G@0H@10Ti@1fj@0hj@1Lk@0Tk@0k@160Hr@1:12s@1x1>TOC 1*$0 $ mH ::TOC 2*$0 $ mH ::TOC 3*$p0 $ mH ::TOC 4*$@ 0 $ mH ::TOC 5*$0 $ mH 66TOC 6*$0 $mH ..TOC 7 *$0mH 66TOC 8*$0 $mH 66TOC 9*$0 $ mH > >Index 1*$` $ mH > >Index 2*$0 $ mH :.: TOA Heading *$ $mH &"&CaptionCJ2O2_Equation Caption@B@@ Body Text!$*$  @CJmH 4>@"4Title"$*$5@CJmH :J@2:Subtitle#$*$5@CJmH DP`BD Body Text 2 $$1$CJhmHnHTR`RTBody Text Indent 2 %1$CJhmH nHtw2 oq,,T-- .J../m//0/020@113Q45999=9>98:;>BCSDTDsDDEESQT UoUWXX=\\f^__!`1`2`P`Q`R`]`^`_```p`````aa!aYaZamaaaabbb(bxbybzbbbbbb/ce ReferenceH*>>TOC 1*$0 $ mH ::TOC 2*$0 $ mH ::TOC 3*$p0 $ mH ::TOC 4*$@ 0 $ mH ::TOC 5*$0 $ mH 66TOC 6*$0 $mH ..TOC 7 *$0mH 66TOC 8*$0 $mH 66TOC 9*$0 $ mH > >Index 1*$` $ mH > >Index 2*$0 $ mH :.: TOA Heading *$ $mH &"&CaptionCJ2O2_Equation Caption@B@@ Body Text!$*$  @CJmH 4>@"4Title"$*$5@CJmH :J@2:Subtitle#$*$5@CJmH DP`BD Body Text 2 $$1$CJhmHnHTR`RTBody Text Indent 2 %1$CJhmH nHtw2 oq,,T-- .J../m//0/020@113Q45999=9>98:;>BCSDTDsDDEESQT UoUWXX=\\f^__!`1`2`P`Q`R`]`^`_```p`````aa!aYaZamaaaabbb(bxbybzbbbbbb/c0c1cAcucvcwccdddsdtd}dddd@eAeBeCeUeeeeeifjffggg|g}gggghhhhii-iiiijjjCkDkdklllllmmn nnnn`oaobooooooooooooooop&p'ppptt\w]w^w_w`wawbwcwdwewfwuw$ H 0c1cAcucvcwccdddsdtd}dddd@eAeBeCeUeeeeeifjffggg|g}gggghhhhii-iiiijjjCkDkdklllllmmn nnnn`oaobooooooooooooooop&p'ppptt\w]w^w_w`wawbwcwdwewfwuw$ H  H  H  H  H  H  H  H  H  H  H H H H !H !H H !H H H H H H H !H H !H H H  H  H  "$HDFHhpr:<dd<|$&f^`bddVXZ\^`bdfhj$d$dd H  H  H  H  H  H  H  H  H  H H H H !H !H H !H H H H H H H !H H !H H H  H  H  #/y18\MQZRdo|RHLNQSVX[]_y p#.q69L*NUbnoR.<jNRIKMORUWZ\^af!0@RoJPTYUnknownPomorski fakultet u Rijeci*I%]%_%%%%%%%'''((("(6(8(u)))D E E+E?EAE^ErEtE{EEEkIIIIIIIII&J:J111111111111155+EBE^EuEEEkIIIIII&J=JCJZJzJJXX^___1`fwgwgwiwiwjwjwkwlwnwowqwrwuwPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdh+q p    zl [ 5? /" r.% $G1' g"( t;%) 4, VQ7 1111111111155ETU.U/U0U1UVWXXs\u\\\s]^_t___1`2`2a2c2d2l2m2o(p2pbpppfwgwiwjwkwlwnwowqwrwswtw00 @11@11@11@111<1 11$@11H$@11$%@11@'@11'@1 0(@1 1$1* 1(14 1 1*1 1.1 101 140 0D@1G@1.G@1VG@1~G@1G@1G@1G@0H@10Ti@1fj@0hj@1Lk@0Tk@0k@160Hr@1:12s@1x1$&tt*:Root Entry@n F@q`&m@GData,@Л@,@@ @a@WordDocumentЛ@pD *ObjectPoolA,@H@ yH @SR^̍R^ 0 k!"#$%&'()*+,-./01Y[zCompObj47qFj0Tablen Nativem9_1009735622FUFR^UFR^fOlenfoEquation Native  1Tablen Native&9SummaryInformation(oF DocumentSummaryInformation8\Z=` dje Normal.dotRPomorski fakultet u Rijeci10oMicrosoft Word 8.0 @ X8 @;^@Xxݚ^@>&Bdbࡱ՜.+,D՜.+,H hp  Odjel za pomorstvo2x  QUEING THEORY Title 6> _PID_GUIDAN{309CD322-8C51-11D3-9237-0040951C6520}ࡱ>   FMicrosoft Word Document MSWordDocWord.Document.89qࡱ #/y18\MQZRdo|THLNQSVX[]_y p#.q69L*NUbnoR.<jNTIKMORUWZ\^af!0@RoJPTYUnknownPomorski fakultet u Rijeci*I%]%_%%%%%%%'''((("(6(8(u)))D E E+E?EAE^ErEtE{EEEkIIIIIIIII&J:J111111111111155+EBE^EuEEEkIIIIII&J=JCJZJzJJXX^___1`fwgwgwiwiwjwjwkwlwnwowqwrwuwPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdh+q p    zl [ 5? /" r.% $G1' g"( t;%) 4, VQ7 1111111111155ETU.U/U0U1UVWXXs\u\\\s]^_t___1`2`2a2c2d2l2m2o'p(p2pbpppfwgwiwjwkwlwnwowqwrwswtw00 @11@11@11@111<1 11$@11H$@11$%@11@'@11'@1 0(@1 1$1* 1(14 1 1*1 1.1 101 140 0D@1G@1.G@1VG@1~G@1G@1G@1G@0H@10Ti@1fj@0hj@1Lk@0Tk@0k@160Hr@1:12s@1x1Etb2!)@xD QUEING THEORYOdjelPomorski fakultet u RijeciDG objbjَ gw ]8\L6P,,,,M,.'0$d7X9K0cK00L000,,0.0^"^* ,$tL&j,:Root Entry@n F@q`tL&m@GData,@Л@,@@ @a@WordDocumentЛ@pD *2ObjectPoolA,@H@ yH @SR^̍R^ 0      !"#$%&'()*+,-./013k6:9Y[zCompObj47qFj0Tablen Nativem9_1009735622FUFR^UFR^fOlenfoEquation Native  1Tablen Native9SummaryInformation(oF DocumentSummaryInformation8\Z7;`}y dje Normal.dotRPomorski fakultet u Rijeci9moMicrosoft Word 8.0 @J@;^@Xxݚ^@&7&Etbࡱ՜.+,D՜.+,H hp  Odjel za pomorstvo2x  QUEING THEORY Title 6> _PID_GUIDAN{309CD322-8C51-11D3-9237-0040951C6520}ࡱ>   FMicrosoft Word Document MSWordDocWord.Document.89qࡱࡱ> jGՀ4O5O5 C=c w lW Q +c b S-r()[]tࡱ> Oh+'0  8 D P \hpxQUEING THEORYoUEIOdjel T^  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]_bcdefghnpoqrsutvxw`{_|~]ࡱ> jGՀ4O5O5 C=c w lW Q +c b S-r()[]tࡱ> Oh+'0  8 D P \hpxQUEING THEORYoUEIOdjel T^  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]_bcdefghnpoqrsutvxw`{_|~] #/y18\MQZRdo| HLNQSVX[]_y p#.q69L*NUbnoR.<j IKMORUWZ\^af!0@RoJPTYUnknownPomorski fakultet u Rijeci*I%]%_%%%%%%%'''((("(6(8(u)))D E E*E>E@E]EqEsEzEEEjI~IIIIIIII%J9J;JBJVJXJyJJJZlqlllamxmmmrw        :::::::::::::::::9999C D 33__`bgh+I%`%%%%%''(("(9(u)),,=1>1111111111111*EAE]EtEEEjIIIIII%JC:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING CONTAINER-TRIESTE.docPomorski fakultet u Rijeci>C:\Radovi\AutoRecovery save of MODELLING CONTAINER-TRIESTE.asdPomorski fakultet u Rijeci.C:\Radovi\Edna\MODELLING ELLING CONTAINER-TRIESTE.doch+q p    zl [ 5? /" r.% $G1' g"( t;%) 4, VQ7 11111111111EST-U.U/U0UUVXXr\t\\\r]r___/`0`0a0c0d0l0m0o0pdwewgwhwiwjwlwmwowpwqwrw00 @11@11@11@111<1 11$@11H$@11$%@11@'@11'@1 0(@1 1$1* 1(14 1 1*1 1.1 101 140 0D@1G@1.G@1VG@1~G@1G@1G@1G@0H@1 0Ti@160Hr@1:12s@1x1 _PID_GUIDAN{309CD322-8C51-11D3-9237-0040951C6520}ࡱ>   FMicrosoft Word Document MSWordDocWord.Document.89qࡱࡱ> jGՀ4O5O5 C=c w lW Q +c b S-r()[]tࡱ> Oh+'0  8 D P \hpxQUEING THEORYoUEIOdjel T\Z7W`CompObj92[]FfObjInfo^Equation Native P_994063213aF yR^ yR^I_994063214tive_CZF qR^ qR^\Ole734997 FPIC Y\LMETAbj dCompObj92?AFufObjInfoBwEquation Native x_994063217EF$R^$R^I_994063218X5>FY R^Y R^ fOlenfo cPICion Native =@dLMETA23776 FfEquation Native Jh_994063219tive7F@iR^@iR^ \Ole735003 FLPIC 69ML^  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]_bcdefghjynpoqrsutvxw`{}_|~]ObjInfo47-F5Equation Native 6d_994063220<0F`R^`R^fOlenfo 8CompObj#%#fObjInfo&%Equation Native &<_994063221)FЌR^ЌR^