Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Pinotsi, Dimitra
and
Zazanis, Michael A.
2005.
Synchronized queues with deterministic arrivals.
Operations Research Letters,
Vol. 33,
Issue. 6,
p.
560.
Ayhan, Hayriye
and
Kim, Jung-kyung
2007.
A General Class of Closed Fork and Join Queues with Subexponential Service Times.
Stochastic Models,
Vol. 23,
Issue. 4,
p.
523.
Ko, Sung-Seok
2007.
Computational Science and Its Applications – ICCSA 2007.
Vol. 4705,
Issue. ,
p.
758.
Squillante, Mark S.
Zhang, Yanyong
Sivasubramaniam, Anand
and
Gautam, Natarajan
2008.
Generalized parallel-server fork-join queues with dynamic task scheduling.
Annals of Operations Research,
Vol. 160,
Issue. 1,
p.
227.
RAMAKRISHNAN, RAM
and
KRISHNAMURTHY, ANANTH
2008.
ANALYTICAL APPROXIMATIONS FOR KITTING SYSTEMS WITH MULTIPLE INPUTS.
Asia-Pacific Journal of Operational Research,
Vol. 25,
Issue. 02,
p.
187.
Ko, Sung‐Seok
and
Serfozo, Richard F.
2008.
Sojourn times in G/M/1 fork‐join networks.
Naval Research Logistics (NRL),
Vol. 55,
Issue. 5,
p.
432.
Leite, Saul C.
and
Fragoso, Marcelo D.
2010.
Heavy traffic analysis of state-dependent parallel queues with triggers and an application to web search systems.
Performance Evaluation,
Vol. 67,
Issue. 10,
p.
913.
Hoekstra, G. J.
van der Mei, R. D.
and
Bosman, J. W.
2010.
On Comparing the Performance of Dynamic Multi-Network Optimizations.
p.
1.
Li, Jun
and
Zhao, Yiqiang Q.
2010.
ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL.
Probability in the Engineering and Informational Sciences,
Vol. 24,
Issue. 4,
p.
473.
Dai, Hongsheng
2011.
Exact Monte Carlo simulation for fork-join networks.
Advances in Applied Probability,
Vol. 43,
Issue. 02,
p.
484.
Chen, Ray Jinzhu
2011.
An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems.
IEEE Transactions on Parallel and Distributed Systems,
Vol. 22,
Issue. 5,
p.
874.
Dai, Hongsheng
2011.
Exact Monte Carlo simulation for fork-join networks.
Advances in Applied Probability,
Vol. 43,
Issue. 2,
p.
484.
Chen, Ray Jinzhu
Reschke, Kevin Scott
and
Tong, Muchenxuan
2011.
Simulation & Analysis of a Mean Response Time Upper-bound for Homogeneous Fork/Join Queues.
p.
430.
Ko, Sung-Seok
Choi, Jin Young
and
Seo, Dong-Won
2011.
Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy.
Computers & Operations Research,
Vol. 38,
Issue. 2,
p.
582.
Terekhov, Daria
Doğru, Mustafa K.
Özen, Ulaş
and
Beck, J. Christopher
2012.
Solving two-machine assembly scheduling problems with inventory constraints.
Computers & Industrial Engineering,
Vol. 63,
Issue. 1,
p.
120.
Ramakrishnan, Ram
and
Krishnamurthy, Ananth
2012.
Performance evaluation of a synchronization station with multiple inputs and population constraints.
Computers & Operations Research,
Vol. 39,
Issue. 3,
p.
560.
Hoekstra, G.J.
van der Mei, R.D.
and
Bosman, J.W.
2013.
Efficient traffic splitting in parallel TCP-based wireless networks: Modelling and experimental evaluation.
p.
1.
De Cuypere, Eline
De Turck, Koen
and
Fiems, Dieter
2014.
A Maclaurin-series expansion approach to multiple paired queues.
Operations Research Letters,
Vol. 42,
Issue. 3,
p.
203.
Hoekstra, G. J.
van der Mei, R. D.
and
Bosman, J. W.
2014.
Traffic splitting policies in parallel queues with concurrent access: A comparison.
p.
1.
Thomasian, Alexander
2015.
Analysis of Fork/Join and Related Queueing Systems.
ACM Computing Surveys,
Vol. 47,
Issue. 2,
p.
1.