Relevant bibliographies by topics / Single-Server Queue System

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Single-Server Queue System'

Author: Grafiati
Published: 4 June 2025
Last updated: 23 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Single-Server Queue System.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Single-Server Queue System"

1

Liang, Huei-Mei, and V. G. Kulkarni. "Stability condition for a single-server retrial queue." Advances in Applied Probability 25, no. 03 (1993): 690–701. http://dx.doi.org/10.1017/s0001867800025611.

Full text
Abstract:
A single-server retrial queue consists of a primary queue, an orbit and a single server. Assume the primary queue capacity is 1 and the orbit capacity is infinite. Customers can arrive at the primary queue either from outside the system or from the orbit. If the server is busy, the arriving customer joins the orbit and conducts a retrial later. Otherwise, he receives service and leaves the system. We investigate the stability condition for a single-server retrial queue. Let λ be the arrival rate and 1/μ be the mean service time. It has been proved that λ / μ < 1 is a sufficient stability condition for the M/G /1/1 retrial queue with exponential retrial times. We give a counterexample to show that this stability condition is not valid for general single-server retrial queues. Next we show that λ /μ < 1 is a sufficient stability condition for the stability of a single-server retrial queue when the interarrival times and retrial times are finite mixtures of Erlangs.
APA, Harvard, Vancouver, ISO, and other styles
2

Takagi, Hideaki. "Analysis of finite-capacity polling systems." Advances in Applied Probability 23, no. 2 (1991): 373–87. http://dx.doi.org/10.2307/1427754.

Full text
Abstract:
We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.
APA, Harvard, Vancouver, ISO, and other styles
3

Takagi, Hideaki. "Analysis of finite-capacity polling systems." Advances in Applied Probability 23, no. 02 (1991): 373–87. http://dx.doi.org/10.1017/s0001867800023557.

Full text
Abstract:
We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Huei-Mei, and V. G. Kulkarni. "Stability condition for a single-server retrial queue." Advances in Applied Probability 25, no. 3 (1993): 690–701. http://dx.doi.org/10.2307/1427530.

Full text
Abstract:
A single-server retrial queue consists of a primary queue, an orbit and a single server. Assume the primary queue capacity is 1 and the orbit capacity is infinite. Customers can arrive at the primary queue either from outside the system or from the orbit. If the server is busy, the arriving customer joins the orbit and conducts a retrial later. Otherwise, he receives service and leaves the system.We investigate the stability condition for a single-server retrial queue. Let λ be the arrival rate and 1/μ be the mean service time. It has been proved that λ/μ < 1 is a sufficient stability condition for the M/G/1/1 retrial queue with exponential retrial times. We give a counterexample to show that this stability condition is not valid for general single-server retrial queues. Next we show that λ /μ < 1 is a sufficient stability condition for the stability of a single-server retrial queue when the interarrival times and retrial times are finite mixtures of Erlangs.
APA, Harvard, Vancouver, ISO, and other styles
5

DUAN, ZHE, and MELIKE BAYKAL-GÜRSOY. "A NOTE ON INFINITE-SERVER MARKOV MODULATED AND SINGLE-SERVER RETRIAL QUEUES." Asia-Pacific Journal of Operational Research 31, no. 02 (2014): 1440003. http://dx.doi.org/10.1142/s021759591440003x.

Full text
Abstract:
We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the single-server retrial queue analyzed in Keilson and Servi [Keilson, J and L Servi (1993). The matrix M/M/∞ system: Retrial models and Markov modulated sources. Advances in Applied Probability, 25, 453–471]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues [Keilson, J and L Servi (1993). The matrix M/M/∞ system: Retrial models and Markov modulated sources. Advances in Applied Probability, 25, 453–471; Baykal-Gürsoy, M and W Xiao (2004). Stochastic decomposition in M/M/∞ queues with Markov-modulated service rates. Queueing Systems, 48, 75–88]. The main contribution of the present paper is the derivation of the explicit form of the stationary system size distributions. Numerical examples are presented visually exhibiting the effect of various parameters on the stationary distributions.
APA, Harvard, Vancouver, ISO, and other styles
6

Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.

Full text
Abstract:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
APA, Harvard, Vancouver, ISO, and other styles
7

Chydzinski, Andrzej, Marek Barczyk, and Dominik Samociuk. "The Single-Server Queue with the Dropping Function and Infinite Buffer." Mathematical Problems in Engineering 2018 (October 9, 2018): 1–12. http://dx.doi.org/10.1155/2018/3260428.

Full text
Abstract:
We present an analysis of queues with the dropping function and infinite buffer. In such queues, the arriving packet (job, customer, etc.) can be dropped with the probability which is a function of the queue size. Currently, the main application area of the dropping function is active queue management in routers, but it is applicable also in many other queueing systems. So far, queues with the dropping function have been analyzed with finite buffers only, which led to complicated, computationally demanding formulas. Assuming infinite buffers enabled us herein to obtain formulas in compact, easy to use forms. Moreover, a model with the infinite buffer can often be used as a good approximation of the real queue, in which the buffer is large. We start with noticing that the classic stability condition, ρ<1, cannot be used for queues with the dropping function and infinite buffer. For this reason, we prove a few new, easy to use conditions, which guarantee system stability or instability. Then we prove several theorems on popular performance characteristics, including the queue size, busy period, loss ratio, output rate, and system response time. Additionally, we derive a special, very important characteristic called the burst ratio, which may influence severely the quality of real-time multimedia transmissions. All the theorems are illustrated with numerical examples, demonstrating in particular how the system stability may be tested and how the shape of the dropping function may affect different performance characteristics.
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Thomas Y. S. "Analysis of Single Buffer Random Polling System With State-Dependent Input Process and Server/Station Breakdowns." International Journal of Operations Research and Information Systems 9, no. 1 (2018): 22–50. http://dx.doi.org/10.4018/ijoris.2018010102.

Full text
Abstract:
Models and analytical techniques are developed to evaluate the performance of two variations of single buffers (conventional and buffer relaxation system) multiple queues system. In the conventional system, each queue can have at most one customer at any time and newly arriving customers find the buffer full are lost. In the buffer relaxation system, the queue being served may have two customers, while each of the other queues may have at most one customer. Thomas Y.S. Lee developed a state-dependent non-linear model of uncertainty for analyzing a random polling system with server breakdown/repair, multi-phase service, correlated input processes, and single buffers. The state-dependent non-linear model of uncertainty introduced in this paper allows us to incorporate correlated arrival processes where the customer arrival rate depends on the location of the server and/or the server's mode of operation into the polling model. The author allows the possibility that the server is unreliable. Specifically, when the server visits a queue, Lee assumes that the system is subject to two types of failures: queue-dependent, and general. General failures are observed upon server arrival at a queue. But there are two possibilities that a queue-dependent breakdown (if occurs) can be observed; (i) is observed immediately when it occurs and (ii) is observed only at the end of the current service. In both cases, a repair process is initiated immediately after the queue-dependent breakdown is observed. The author's model allows the possibility of the server breakdowns/repair process to be non-stationary in the number of breakdowns/repairs to reflect that breakdowns/repairs or customer processing may be progressively easier or harder, or that they follow a more general learning curve. Thomas Y.S. Lee will show that his model encompasses a variety of examples. He was able to perform both transient and steady state analysis. The steady state analysis allows us to compute several performance measures including the average customer waiting time, loss probability, throughput and mean cycle time.
APA, Harvard, Vancouver, ISO, and other styles
9

Renisagayaraj M, Roja R, Bhuvaneswari S, Suganthi P, and Sujatha R. "A Study of Multiserver Retrial Queues With Different Stages of Homogeneous Service." Journal of Computational Mathematica 7, no. 1 (2023): 017–22. http://dx.doi.org/10.26524/cm159.

Full text
Abstract:
We discuss a queuing system with retrial of customers. Two models are discussed. First, we investigate single server queues in parallel, when the customer going to search and join the shorter of the two queues and in the second model we introduce the multiserver queue to multiserver retrial queue system. Multiserver provides different stages of homogeneous service in succession.
APA, Harvard, Vancouver, ISO, and other styles
10

Devos, Arnaud, Joris Walraevens, Dieter Fiems, and Herwig Bruneel. "Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue." Mathematics 9, no. 21 (2021): 2723. http://dx.doi.org/10.3390/math9212723.

Full text
Abstract:
This paper compares two discrete-time single-server queueing models with two queues. In both models, the server is available to a queue with probability 1/2 at each service opportunity. Since obtaining easy-to-evaluate expressions for the joint moments is not feasible, we rely on a heavy-traffic limit approach. The correlation coefficient of the queue-contents is computed via the solution of a two-dimensional functional equation obtained by reducing it to a boundary value problem on a hyperbola. In most server-sharing models, it is assumed that the system is work-conserving in the sense that if one of the queues is empty, a customer of the other queue is served with probability 1. In our second model, we omit this work-conserving rule such that the server can be idle in case of a non-empty queue. Contrary to what we would expect, the resulting heavy-traffic approximations reveal that both models remain different for critically loaded queues.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Single-Server Queue System"

1

Chandramouli, Yegnanarayanan 1962. "On the use of quasi-stationary distributions in monitoring a single server queue." Thesis, The University of Arizona, 1988. http://hdl.handle.net/10150/276891.

Full text
Abstract:
In the operation of stochastic systems, and of queues in particular, it is important to recognize quickly the development in time of situations not compatible with their design criteria. Once such an anomalous condition is detected, it has to be decided, if the occurrence of that event can be attributed to chance or is due to a change in the parameters governing the system. This procedure of tracking the system is defined as monitoring. The design of a monitor and the selection of suitable threshold regions for monitoring a single server queue are the subjects of this thesis. The notion of profile curves, useful in formalizing monitoring schemes for queues, is also discussed. Finally, some numerical examples are presented to illustrate the performance of the monitor designed.
APA, Harvard, Vancouver, ISO, and other styles
2

"Communication systems modeled by single server queue with interrupted services." Thesis, 2006. http://library.cuhk.edu.hk/record=b6074162.

Full text
Abstract:
Optical buffers are essential components of future optical switches for resolving contentions among arriving packets. Currently, optical buffers are composed of Fiber Delay Lines (FDL). Unlike the conventional electronic buffer, optical buffer only has finite time resolution, which introduces a void period between two successive buffered packets. The void period leads to service interruptions and deteriorates the buffer performance. We develop a queueing system with exceptional service for the first packet in each busy period to model the buffer behavior. For the first time, the closed-form expressions of packet blocking probability and mean delay of optical buffer are derived. We show that the packet blocking probability can be minimized by finding the optimal FDL time granularity. This optimal granularity is neither sensitive to packet length distribution, nor sensitive to the buffer length, it is mainly determined by the traffic load.<br>Service interruption is a special case of varying service rate. A current trend in wireless communication is to enable devices to operate using many different transmission rates. This motivates us to develop the queueing models with varying service rate. We apply the continuous time Markov chain to characterize the service rate varying process, and develop a queueing system with Markov-modulated service rate. In this kind of problem, due to the complex interaction between the rate varying process and packet arrival process, it is hard to characterize the server state evolvement; this makes it difficult to get an analytical solution, even the server only has two service rates. To escape the trap, first, we develop a discrete time Markov chain to model the server state transition process, which makes our problem to be easily manipulated. Second, apart from the previous methods, we concentrate on the moments of the packet number in system. We find the recursive relationship between the moments of packet number, this fundamental relationship widely exists in the birth-death queue systems. Our results provide a new methodology to the design of communication systems with varying service rate.<br>This thesis is aimed to study the interaction between service interruption and the operation of communication systems, and develop analytical methods to help the design and optimization of communication systems with interrupted services. Our work are focused on two systems: optical buffer and wireless sensor network. The common ground of these two problems is they both present the features of service interruption.<br>Wireless sensor network is an ad hoc network consisting of hundreds of sensor nodes equipped with limited power sources, transmission range and functionality. A simple and effective way to save energy and prolong the network lifetime is to let the nodes interrupt their sensing and data transmission process, enter sleep mode randomly. However, sleep mode corresponds to low power consumption as well as to reduced network capacity, increased latency and slowed system response. We develop a queueing model with server shutting down in a varying neighborhood to model the behavior of sensor nodes, Combining the node queueing model and the network flow balance model, we construct an analytical framework to model the network performance, derive the network capacity, packet delivery delay and node responsive property. We also develop a node power consumption model, which takes the node sleep to active transition frequency into consideration. Our results demonstrate that the sleep/active dynamics produces the predominant impact on the average power consumption and packet delay, and properly choosing the time scale of sleep/active cycle is vital to design a power-efficient sensor network.<br>Liu Jianming.<br>"Apr. 2006."<br>Adviser: Tony Tong Lee.<br>Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6623.<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2006.<br>Includes bibliographical references (p. 109-117).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Abstracts in English and Chinese.<br>School code: 1307.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Single-Server Queue System"

1

Suranga Sampath, M. I. G., and K. Kalidass. "Transient Analysis of a Repairable Single Server Queue with Working Vacations and System Disasters." In Communications in Computer and Information Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36625-4_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Marie, Raymond A. "Performance of a Single Server Queue Supported by an Intermittent Server." In Systems Modeling: Methodologies and Tools. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92378-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Akbari-Moghaddam, Maryam, and Douglas G. Down. "SEH: Size Estimate Hedging for Single-Server Queues." In Quantitative Evaluation of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85172-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sanga, Sudeep Singh. "Profit and Cost Optimization for Single-Server Markovian Retrial Queue with Server Breakdown, Customer Balking and Feedback." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-73318-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Anand Gnana Selvam, S., B. Chandrasekar, D. Moganraj, and S. Janci Rani. "Impact of Single Server Queue Having Machine Repair with Catastrophes Using Probability Generating Function Method." In Emerging Research in Data Engineering Systems and Computer Communications. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-0135-7_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Connell, Neil O’. "Queue lengths and departures at single-server resources." In Stochastic Networks Theory and Applications. Oxford University PressOxford, 1996. http://dx.doi.org/10.1093/oso/9780198523994.003.0005.

Full text
Abstract:
Abstract In this paper I will review and illustrate some large deviation results for queues with interacting traffic, both for shared buffer and shared capacity models. These results are examples of a general scheme which can be applied to an endless variety of network problems where the goal is to establish probability approximations for aspects of a system (such as queue lengths) under very general ergodicity and mixing assumptions about the network inputs.
APA, Harvard, Vancouver, ISO, and other styles
7

"Stochastic Analytical Modeling Based on Queuing Systems." In Deterministic and Stochastic Approaches in Computer Modeling and Simulation. IGI Global, 2023. http://dx.doi.org/10.4018/978-1-6684-8947-5.ch009.

Full text
Abstract:
The subject of discussion in this chapter is the stochastic approach to model investigation of queuing systems (QS) with waiting buffer (queue) and server (service unit). Two types of QS are presented: single-channel and multi-channel QS. Single-channel QS is discussed in the first part of the chapter with presentation of main characteristics such as workload of the resource, queuing length, total number of requests in system, waiting time and time for presence in the system. The second part deals with organization of analytical investigation of QS and in particular presentation of discrete and continuous time Markov chains. The two possibilities for investigation were considered – during the development of a transient regime and the conditions for reaching a steady state regime. Three versions of QS are presented in QS – with an infinite buffer, with a limited buffer, and QS with request rejections in the absence of a buffer. Some examples for stochastic model investigation are presented in the last part.
APA, Harvard, Vancouver, ISO, and other styles
8

"Scheduling a Single-Server Queue." In Optimal Design of Queueing Systems. Chapman and Hall/CRC, 2009. http://dx.doi.org/10.1201/9781420010008-a.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Single-Server Queue System"

1

Aissani, Amar, and Tuan Phung-Duc. "Profiting the idleness in single server system with orbit-queue." In VALUETOOLS 2017: 11th EAI International Conference on Performance Evaluation Methodologies and Tools. ACM, 2017. http://dx.doi.org/10.1145/3150928.3150929.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhi Wang, Yeqiong Song, Hai-bin Yu, and Youxian Sun. "Stability analysis for multi-class multi-queue single server system under polling table." In Proceedings of 2002 American Control Conference. IEEE, 2002. http://dx.doi.org/10.1109/acc.2002.1025405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Konovalov, Mikhail, and Rostislav Razumchik. "Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel." In 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0272.

Full text
Abstract:
Consideration is given to a dispatching system, where jobs, arriving in batches, cannot be stored and thus must be immediately routed to single-server FIFO queues operating in parallel. The dispatcher can memorize its routing decisions but at any time instant does not have any system's state information. The only information available is the batch/job size and inter-arrival time distributions, and the servers' service rates. Under these conditions, one is interested in the routing policies which minimize the job's long-run mean response time. The single-parameter routing policy is being proposed which, according to the numerical experiments, outperforms best routing rules known by now for non-observable dispatching systems: probabilistic and deterministic. Both the batch-wise and job-wise assignments are studied. Extension to systems with unreliable servers is also addressed.
APA, Harvard, Vancouver, ISO, and other styles
4

Efrosinin, Dmitry, and Olga Semenova. "Matrix-analytical approach to analysis of a single-server retrial queue with non-reliable removable server." In 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2010). IEEE, 2010. http://dx.doi.org/10.1109/icumt.2010.5676526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Prasad, B. V. S. N. Hari, Hanumantha Rao Sama, Vasanta Kumar Vemuri, and Satish Kumar Kalapala. "A two-phase service single server Morkovian queue under N-policy with a fuzzy environment." In INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING & COMMUNICATION ENGINEERING SYSTEMS: SPACES-2021. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0112510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dimitriou, Ioannis, and Tuan Phung-Duc. "A Riemann-Hilbert boundary value problem for single-server systems with two queues for blocked and feedback customers." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5043831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Suieshova, Alina, Nurzhan Seitmaganbetov, Dauren Kurimov, et al. "Whitespace Dashboard: A Digital Solution to Support Production Optimization and Decision-Making Processes by Using Field Deliverability Forecasts and Planned/Unplanned Field Activities." In SPE Caspian Technical Conference and Exhibition. SPE, 2023. http://dx.doi.org/10.2118/217598-ms.

Full text
Abstract:
Abstract For most of the life of Tengiz oil field, production has been constrained by the processing capacity of the existing plant facilities, therefore, the excess capacity of oil production above facility capacities (so called whitespace) has been used to compensate losses while conducting maintenance, reservoir surveillance and other field activities without impact on overall production. This paper describes an improved production forecasting approach to optimize field activities planning. The initial forecasting methodology required manual inputs. These manual set-up of models for predicting future production is time consuming and can sometimes be subject to human errors. Therefore, it was decided to automate the process and move from an Excel-based tool to digital solutions. The WhiteSpace Dashboard is a web-based tool designed to optimize and automate inputs for Integrated Production Modelling (IPM) and improve the decision-making process, while maximizing production deliverability to the plants. The tool embodies a set of automated workflows that increase the accuracy of production modeling based on automated data inputs, additional functionalities, data quality checks, ability to run several simulation cases on a cloud server and ability to compare the results. The new dashboard also aids to minimize human error and allows QA/QC of input and output data and parameters. The development of a fit-for-purpose digital tool, the WhiteSpace Dashboard, allowed TCO to combine all existing systems of record into one database with the opportunity to integrate various activities into one set of data input for production forecasting. All the subsurface data required for production forecasting is also automatically pulled from the Digital Oil Field system of record with functionality to change the values for subsurface data such as Gas-Oil-Ratio (GOR), reservoir pressure and productivity index inside the web interface. Users have the flexibility to set up several simulation cases, run them in queues, view the status of the runs, and analyze the simulation results any time after completion. The output of the production modeling is the production forecast, and users have all the required functionalities to analyze each scenario in details. Additionally, users can compare several cases on a single chart. The developed tool significantly improves selection of the best schedule for operational activities to minimize risks of production losses, optimize production and meet production targets. This paper aims to provide an overview of the integrated production forecasting tool and to share the best practices in the planning of operational activities in the field with optimized schedule and minimized impact on overall field production.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Single-Server Queue System' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography