Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$ G I X / G e o Y / 1
Author
Abstract
Suggested Citation
DOI: 10.1007/s11134-019-09600-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Seok Ho Chang & Dae Won Choi, 2006. "Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The M X /G Y /1/K + B Queue with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 218-228, May.
- Dorit S. Hochbaum & Dan Landy, 1997. "Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime," Operations Research, INFORMS, vol. 45(6), pages 874-885, December.
- Lev Abolnikov & Alexander Dukhovny, 1991. "Markov chains with transition delta-matrix: ergodicity conditions, invariant probability measures and applications," International Journal of Stochastic Analysis, Hindawi, vol. 4, pages 1-23, January.
- Carl M. Harris & Percy H. Brill & Martin J. Fischer, 2000. "Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 261-271, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Nitin Kumar & F. P. Barbhuiya & U. C. Gupta, 2020. "Unified killing mechanism in a single server queue with renewal input," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 246-259, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
- Priyanka Kalita & Dharmaraja Selvamuthu, 2023. "Stochastic modelling of sleeping strategy in 5G base station for energy efficiency," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 83(2), pages 115-133, June.
- Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
- Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
- C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
- S. Pradhan & U.C. Gupta & S.K. Samanta, 2016. "Queue-length distribution of a batch service queue with random capacity and batch size dependent service: M / G r Y / 1 $M/{G^{Y}_{r}}/1$," OPSEARCH, Springer;Operational Research Society of India, vol. 53(2), pages 329-343, June.
- Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
- Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
- Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
- Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
- John F. Shortle & Martin J. Fischer & Percy H. Brill, 2007. "Waiting-Time Distribution of M/D N /1 Queues Through Numerical Laplace Inversion," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 112-120, February.
- Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
- Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
- Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
- Payman Jula & Robert C. Leachman, 2010. "Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints," Operations Research, INFORMS, vol. 58(4-part-1), pages 933-947, August.
- A H Kashan & B Karimi, 2008. "Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1269-1280, September.
- Rongqi Li & Zhiyi Tan & Qianyu Zhu, 2021. "Batch scheduling of nonidentical job sizes with minsum criteria," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 543-564, October.
- Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
- Sung, Chang Sup & Kim, Young Hwan & Yoon, Sang Hum, 2000. "A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines," European Journal of Operational Research, Elsevier, vol. 121(1), pages 179-192, February.
- Xiaotie Deng & Haodi Feng & Guojun Li & Benyun Shi, 2005. "A PTAS for Semiconductor Burn-in Scheduling," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 5-17, February.
More about this item
Keywords
Batch arrival; Difference equation; Discrete-time; Random service capacity; Renewal process; Supplementary variable;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:91:y:2019:i:3:d:10.1007_s11134-019-09600-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.