Log in

Relevant bibliographies by topics / Batch arrival

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Batch arrival'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 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 'Batch arrival.'

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 "Batch arrival"

1

Lichtzinder, B. Ya, A. Yu Privalov, and V. I. Moiseev. "Batch poissonian arrival models of multiservice network traffic." Проблемы передачи информации 59, no. 1 (2023): 71–79. http://dx.doi.org/10.31857/s0555292323010060.

Full text

Abstract:

The emergence of packet-switched communication networks has made it clear that Poissonian arrival flow models are not quite adequate and required the development of new models based on non-Poisson distributions. This paper is devoted to the analysis of a particular case of a batch Markovian flow, namely, batch (nonordinary) Poissonian arrivals. Such a flow is stationary and memoryless but not ordinary. We consider a class of queueing systems with constant service time. We present results of analytical computations of arrival flow parameters and also simulation results. We show that the varianc

APA, Harvard, Vancouver, ISO, and other styles

2

Van Houdt, B., and C. Blondia. "The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue." Journal of Applied Probability 39, no. 1 (2002): 213–23. http://dx.doi.org/10.1239/jap/1019737998.

Full text

Abstract:

This paper presents an algorithmic procedure to calculate the delay distribution of a type k customer in a first-come-first-served (FCFS) discrete-time queueing system with multiple types of customers, where each type has different service requirements (the MMAP[K]/PH[K]/1 queue). First, we develop a procedure, using matrix analytical methods, to handle arrival processes that do not allow batch arrivals to occur. Next, we show that this technique can be generalized to arrival processes that do allow batch arrivals to occur. We end the paper by presenting some numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

3

Van Houdt, B., and C. Blondia. "The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue." Journal of Applied Probability 39, no. 01 (2002): 213–23. http://dx.doi.org/10.1017/s0021900200021616.

Full text

Abstract:

This paper presents an algorithmic procedure to calculate the delay distribution of a type k customer in a first-come-first-served (FCFS) discrete-time queueing system with multiple types of customers, where each type has different service requirements (the MMAP[K]/PH[K]/1 queue). First, we develop a procedure, using matrix analytical methods, to handle arrival processes that do not allow batch arrivals to occur. Next, we show that this technique can be generalized to arrival processes that do allow batch arrivals to occur. We end the paper by presenting some numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

4

Krishnamoorthy, Achyutha, Anu Nuthan Joshua, and Dmitry Kozyrev. "Analysis of a Batch Arrival, Batch Service Queuing-Inventory System with Processing of Inventory While on Vacation." Mathematics 9, no. 4 (2021): 419. http://dx.doi.org/10.3390/math9040419.

Full text

Abstract:

A single-server queuing-inventory system in which arrivals are governed by a batch Markovian arrival process and successive arrival batch sizes form a finite first-order Markov chain is considered in this paper. Service is provided in batches according to a batch Markovian service process, with consecutive service batch sizes forming a finite first-order Markov chain. A service starts for the next batch on completion of the current service, provided that inventory is available at that epoch; otherwise, there will be a delay in starting the next service. When the service of a batch is completed

APA, Harvard, Vancouver, ISO, and other styles

5

Banik, A. D., M. L. Chaudhry, and James J. Kim. "A Note on the Waiting-Time Distribution in an Infinite-Buffer GI[X]/C-MSP/1 Queueing System." Journal of Probability and Statistics 2018 (September 2, 2018): 1–10. http://dx.doi.org/10.1155/2018/7462439.

Full text

Abstract:

This paper deals with a batch arrival infinite-buffer single server queue. The interbatch arrival times are generally distributed and arrivals are occurring in batches of random size. The service process is correlated and its structure is presented through a continuous-time Markovian service process (C-MSP). We obtain the probability density function (p.d.f.) of actual waiting time for the first and an arbitrary customer of an arrival batch. The proposed analysis is based on the roots of the characteristic equations involved in the Laplace-Stieltjes transform (LST) of waiting times in the syst

APA, Harvard, Vancouver, ISO, and other styles

6

Pang, Guodong, and Ward Whitt. "INFINITE-SERVER QUEUES WITH BATCH ARRIVALS AND DEPENDENT SERVICE TIMES." Probability in the Engineering and Informational Sciences 26, no. 2 (2012): 197–220. http://dx.doi.org/10.1017/s0269964811000337.

Full text

Abstract:

Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within different batches be independent. We exploit a recently established heavy-traffic limit for the number of busy servers to determine the performance impact of the dependence among the service times. The

APA, Harvard, Vancouver, ISO, and other styles

7

Chydzinski, Andrzej. "Burst ratio for a versatile traffic model." PLOS ONE 17, no. 8 (2022): e0272263. http://dx.doi.org/10.1371/journal.pone.0272263.

Full text

Abstract:

We deal with a finite-buffer queue, in which arriving jobs are subject to loss due to buffer overflows. The burst ratio parameter, which reflects the tendency of losses to form long series, is studied in detail. Perhaps the most versatile model of the arrival stream is used, i.e. the batch Markovian arrival process (BMAP). Among other things, it enables modeling the interarrival time density function, the interarrival time autocorrelation function and batch arrivals. The main contribution in an exact formula for the burst ratio in a queue with BMAP arrivals and arbitrary service time distribut

APA, Harvard, Vancouver, ISO, and other styles

8

Chydzinski, Andrzej. "Buffer overflow period in a batch-arrival queue with autocorrelated arrivals." Applied Mathematics & Information Sciences 7, no. 4 (2013): 1633–41. http://dx.doi.org/10.12785/amis/070450.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chao, Xiuli, Qi-Ming He, and Sheldon Ross. "Tollbooth tandem queues with infinite homogeneous servers." Journal of Applied Probability 52, no. 4 (2015): 941–61. http://dx.doi.org/10.1239/jap/1450802745.

Full text

Abstract:

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Bo

APA, Harvard, Vancouver, ISO, and other styles

10

Chao, Xiuli, Qi-Ming He, and Sheldon Ross. "Tollbooth tandem queues with infinite homogeneous servers." Journal of Applied Probability 52, no. 04 (2015): 941–61. http://dx.doi.org/10.1017/s0021900200113002.

Full text

Abstract:

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Bo

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Batch arrival"

1

Masuyama, Hiroyuki. "Studies on Algorithmic Analysis of Queues with Batch Markovian Arrival Streams." 京都大学 (Kyoto University), 2004. http://hdl.handle.net/2433/148282.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kawanishi, Kenichi. "Studies on Batch Arrival Models and Related Traffic Issues in Communication Systems." 京都大学 (Kyoto University), 2001. http://hdl.handle.net/2433/150627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Korkmaz, Gediz. "Batch Scheduling Of Incompatible Jobs On A Single Reactor With Dynamic Arrivals." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605096/index.pdf.

Full text

Abstract:

In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combination branch and bound algorithm can solve the problems about 25 jobs with 4 different job

APA, Harvard, Vancouver, ISO, and other styles

4

Baruah, Monita. "Analysis of some batch arrival queueing systems with balking, reneging, random breakdowns, fluctuating modes of service and Bernoulli schedulled server vacations." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/14524.

Full text

Abstract:

The purpose of this research is to investigate and analyse some batch arrival queueing systems with Bernoulli scheduled vacation process and single server providing service. The study aims to explore and extend the work done on vacation and unreliable queues with a combination of assumptions like balking and re-service, reneging during vacations, time homogeneous random breakdowns and fluctuating modes of service. We study the steady state properties, and also transient behaviour of such queueing systems. Due to vacations the arriving units already in the system may abandon the system without

APA, Harvard, Vancouver, ISO, and other styles

5

Keilson, Julian, and A. Seidmann. "M/G/ oo with Batch Arrivals." Massachusetts Institute of Technology, Operations Research Center, 1987. http://hdl.handle.net/1721.1/5138.

Full text

Abstract:

Let po(n) be the distribution of the number N(oo) in the system at ergodicity for systems with an infinite number of servers, batch arrivals with general batch size distribution and general holding times. This distribution is of impotance to a variety of studies in congestion theory, inventory theory and storage systems. To obtain this distribution, a more general problem is addressed . In this problem, each epoch of a Poisson process gives rise to an independent stochastic function on the lattice of integers, which may be viewed as a stochastic impulse response. A continuum analogue to the la

APA, Harvard, Vancouver, ISO, and other styles

6

Tang, Stanley Chinwan. "Numerical methods for multiserver discrete time queues with batch Markovian arrivals." Diss., This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-10042006-143849/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Baey, Sébastien. "Contribution à la qualité de service d'une pile radio flexible pour la transmission de données multimédia en mode paquet sur interface radio UMTS WCDMA." Paris 11, 2004. http://www.theses.fr/2004PA112111.

Full text

Abstract:

Cette thèse traite de l'intégration du trafic multimédia sur la voie montante de l'interface radio de l'UMTS. Le problème est abordé dans sa globalité, considérant à la fois les possibilités de partage de la ressource, une bonne caractérisation du trafic à transmettre et les possibilités ouvertes dans la norme UMTS. L'attention est plus particulièrement portée sur la vidéo MPEG4 et les données de type Internet. La première partie de la thèse dégage une approche du partage de ressource radio en mode WCDMA. Les performances du mécanisme de multiplexage de niveau couche physique avec qualité de t

APA, Harvard, Vancouver, ISO, and other styles

8

Khalaf, Rehab F. "On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys." Thesis, Brunel University, 2012. http://bura.brunel.ac.uk/handle/2438/6416.

Full text

Abstract:

This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns. It is assumed that the repair process does not start immediately after the breakdown. Consequently there maybe a delay in starting repairs. After every service completion the server may go on an optional vacation. When the original vacation is completed the server has the option to go on an extended vacation. It is assumed that the system is equipped with a stand-by server to serve the customers during the vacation period of the main server as well as during the repair p

APA, Harvard, Vancouver, ISO, and other styles

9

Klemm, Alexander, Christoph Lindemann, and Marco Lohmann. "Modeling IP traffic using the batch Markovian arrival process." 2003. https://ul.qucosa.de/id/qucosa%3A32407.

Full text

Abstract:

In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation of Poisson jump probabilities. Moreover, we identify the BMAP as an analytically tractable model of choice for aggregated traffic modeling of IP networks. The key idea of this aggregated traffic model lies in customizing the BMAP such that diffe

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Jia-Rong, and 李家榮. "Two‐stage Unrelated Multiprocessor Flow Shop Scheduling with Batch and Job Arrival." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/98134377088152499687.

Full text

Abstract:

碩士<br>輔仁大學<br>企業管理學系管理學碩士班<br>103<br>The major purpose of production scheduling is to enhance the effectiveness of production, machine utilization, and confront varied demand of customers. When enterprises adopt a proper scheduling could contribute to competitive advantage in long run. FSMP (flow shop with multi-processor) is one of common production system in the manufacturing industry, such as heat treatment, chemistry, and semiconductor industry...etc. In practical, unrelated machine were made by its updating order in different stages. It makes machines to be different velocity to process j

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Batch arrival"

1

Martini, Santi. Stroke profile in Surabaya, demographic characteristics, arrival time at hospital, warning sign, and risk factors: Laporan hibah kompetitif penelitian untuk publikasi internasional batch I, tahun anggaran 2009. Universitas Airlangga, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Keilson, Julian. M/G/[infinity symbol] with batch arrivals. Sloan School of Management, Massachusetts Institute of Technology, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pilehvar, Ali. New Queueing Network Approximations for Vaccination Clinics - Studying the Batch Arrival, Batch Service Processes and Stations with no Real Servers. VDM Verlag Dr. Mueller e.K., 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Liu, Liming. Infinite server queues with batch arrivals. 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Seidmann, A., Julian Keilson, and Sloan School of Management. M/G/[infinity Symbol] with Batch Arrivals. Creative Media Partners, LLC, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Konstam, Angus. British Lend-Lease Warships 1940–45. Bloomsbury Publishing Plc, 2024. http://dx.doi.org/10.5040/9781472861276.

Full text

Abstract:

An illustrated history of the American-built destroyers and frigates supplied to the Royal Navy under Lend-Lease, which played a crucial role in Britain's war in the Atlantic. As U-boat attacks on Britain’s vital sea lanes increased in ferocity, and Royal Navy warship losses mounted, the United States passed the Lend-Lease Act, the cornerstone of America’s wartime role as armourer to the Allies. Naval historian Angus Konstam here offers an account of the Royal Navy’s Lend-Lease destroyers and escorts. The first batch were 50 World War I-era 'four-stacker' destroyers, in a deal sealed by the tr

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Batch arrival"

1

Claeys, Dieter, Joris Walraevens, Koenraad Laevens, Bart Steyaert, and Herwig Bruneel. "A Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process." In Analytical and Stochastic Modeling Techniques and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13568-2_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lee, Euiwoong, and Sahil Singla. "Maximum Matching in the Online Batch-Arrival Model." In Integer Programming and Combinatorial Optimization. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59250-3_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jain, Anamika, Sonali Thakur, Bhoopendra Pachauri, and Madhu Jain. "Fuzzy Analysis of Batch Arrival Priority Queueing System with Balking." In Mathematical Modeling and Computation of Real-Time Problems. CRC Press, 2020. http://dx.doi.org/10.1201/9781003055037-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sakai, Yuta, and Tuan Phung-Duc. "Analysis of a Batch Arrival Queue with Power Saving Mode." In Communications in Computer and Information Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-88307-1_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Klemm, Alexander, Christoph Lindemann, and Marco Lohmann. "Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process." In Computer Performance Evaluation: Modelling Techniques and Tools. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46029-2_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kempa, Wojciech M. "Output Process in Batch-Arrival Queue with N-Policy and Multiple Vacations." In Analytical and Stochastic Modeling Techniques and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39408-9_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Gang, Li Xia, Zhaoyu Jiang, Xi Peng, Li Chen, and Bo Bai. "A Two-Step Fitting Approach of Batch Markovian Arrival Processes for Teletraffic Data." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92511-6_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Phung-Duc, Tuan. "Batch Arrival Multiserver Queue with State-Dependent Setup for Energy-Saving Data Center." In Infosys Science Foundation Series. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5951-8_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kempa, Wojciech M., and Rafał Marjasz. "Transient Queueing Delay in a Finite-Buffer Batch-Arrival Model with Constant Repeated Vacations." In Computer Networks. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92459-5_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Chesoong, Alexander Dudin, Sergey Dudin, and Olga Dudina. "Analysis of Multi-server Loss Queueing System with the Batch Marked Markov Arrival Process." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92507-9_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Batch arrival"

1

Dash, Bibhuti Bhusan, Rabinarayan Satpathy, Sudhansu Shekhar Patra, Veena Goswami, and Aditya Rath. "Performance Assessment of Batch Arrival of Tasks in Cloud Data Center." In 2024 IEEE 3rd World Conference on Applied Intelligence and Computing (AIC). IEEE, 2024. http://dx.doi.org/10.1109/aic61668.2024.10731007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pasieka, Engelbert, and Sebastian Engell. "Evolutionary Algorithm Based Real-time Scheduling via Simulation-Optimization for Multiproduct Batch Plants." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.183349.

Full text

Abstract:

Production scheduling in the process industry is an area of significant activity in research and of great practical importance for the performance of industrial companies. In the vast majority of research papers, the scheduling problem is formulated as an off-line problem where a number of jobs is scheduled on a number of resources and the efficiency of the formulation and the solution algorithms is discussed. In reality, however, scheduling is a continuous activity that has to react to the arrival of new orders, to variations in processing times, breakdowns, lack of resources etc. This is ter

APA, Harvard, Vancouver, ISO, and other styles

3

Sorensen, Eva, Dian Ning Chia, and Fanyi Duanmu. "A Superstructure Approach for Optimization of Simulated Moving Bed (SMB) Chromatography." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.130271.

Full text

Abstract:

One of the most successful continuous high-performance liquid chromatography (HPLC) processes for drug manufacturing is the Simulated Moving Bed (SMB). SMB is a multi-column, continuous, chromatographic process that can handle much higher throughputs than regular batch chromatographic processes. The process is initially transient, but eventually arrives at a cyclic steady state, which makes optimization very challenging, even more so when superstructure optimization is involved. To simplify the optimization problem, many researchers fixed the SMB structure, optimizing only the continuous varia

APA, Harvard, Vancouver, ISO, and other styles

4

Phung-Duc, Tuan. "Server farms with batch arrival and staggered setup." In the Fifth Symposium. ACM Press, 2014. http://dx.doi.org/10.1145/2676585.2676613.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Wei, and YingJie Wang. "Analysis of Correlation in Batch Markov Arrival Process." In 2011 International Conference on Control, Automation and Systems Engineering (CASE). IEEE, 2011. http://dx.doi.org/10.1109/iccase.2011.5997806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Jihong, Duihong Jia, and Naishuo Tian. "A batch arrival queue with exponential working vacations." In the 5th International Conference. ACM Press, 2010. http://dx.doi.org/10.1145/1837856.1837863.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Milano, Giancarlo, Nitesh Goyal, and David Basnett. "Tracking Batches Accurately in a Multi-Product Pipeline With Large Elevation Changes and Prominent Slack Flow." In 2018 12th International Pipeline Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/ipc2018-78715.

Full text

Abstract:

When transporting multiple products in a pipeline, it is important to always understand the location of the head and tail of each batch. The operator will know where batch interfaces are in real-time and be ready to swing the valve at the exact time a batch arrives at a station to deliver product to the right storage tank or an end-customer with minimal contamination. It is relatively easy to track multiple batches in a pipeline with no elevation changes, and a fixed internal diameter. However, it is far more complex to track multiple batches in a pipeline with drastic elevation changes and di

APA, Harvard, Vancouver, ISO, and other styles

8

JIOUDI, Bassma, Essaid SABIR, Fouad MOUTAOUAKKIL, and Hicham MEDROMI. "Estimating Parking Time Under Batch Arrival and Dynamic Pricing Policy." In 2019 IEEE 5th World Forum on Internet of Things (WF-IoT'19). IEEE, 2019. http://dx.doi.org/10.1109/wf-iot.2019.8767179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Li, Wei, R. J. Fretwell, and D. D. Kouvatsos. "Performance analysis of queues with batch Poisson arrival and service." In 2011 IEEE 13th International Conference on Communication Technology (ICCT). IEEE, 2011. http://dx.doi.org/10.1109/icct.2011.6158036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Zhi-Ying, and Wen-Long Wang. "The Well-posedness and Regularity of a Batch Arrival Queue." In 3rd Annual International Conference on Management, Economics and Social Development (ICMESD 17). Atlantis Press, 2017. http://dx.doi.org/10.2991/icmesd-17.2017.89.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Batch arrival"

1

Lahav, Ori, Albert Heber, and David Broday. Elimination of emissions of ammonia and hydrogen sulfide from confined animal and feeding operations (CAFO) using an adsorption/liquid-redox process with biological regeneration. United States Department of Agriculture, 2008. http://dx.doi.org/10.32747/2008.7695589.bard.

Full text

Abstract:

The project was originally aimed at investigating and developing new efficient methods for cost effective removal of ammonia (NH₃) and hydrogen sulfide (H₂S) from Concentrated Animal Feeding Operations (CAFO), in particular broiler and laying houses (NH₃) and hog houses (H₂S). In both cases, the principal idea was to design and operate a dedicated air collection system that would be used for the treatment of the gases, and that would work independently from the general ventilation system. The advantages envisaged: (1) if collected at a point close to the source of generation, pollutants would

APA, Harvard, Vancouver, ISO, and other styles

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!