Author:
Tsimashenka Iryna,Knottenbelt William J.,Harrison Peter G.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference29 articles.
1. Ali, M. M., & Gabere, M. N. (2010). A simulated annealing driven multi-start algorithm for bound constrained global optimization. Journal of Computational and Applied Mathematics, 223(10), 2661–2674.
2. Baccelli, F., Makowski, A. M., & Shwartz, A. (1989). The fork–join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds. Advances in Applied Probability, 21(3), 629–660.
3. Baccelli, F., Massey, W. A., & Towsley, D. (1989). Acyclic fork–join queuing networks. Journal of the ACM, 36(3), 615–642.
4. Bolch, G., et al. (2006). Queueing networks and Markov chains. Hoboken, NJ: Wiley.
5. Brent, R. P. (2002). An algorithm with guaranteed convergence for finding a zero of a function. Algorithms for minimization without derivatives, Dover Books on Mathematics. Mineola, NY: Dover Publications.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Stationary Waiting Time in Parallel Queues with Synchronization;Mathematics of Operations Research;2021-02
2. Speed scaling in fork-join queues;Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools;2020-05-18
3. Dynamic Resource Allocation in Fork-Join Queues;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2020-02-07
4. Biased Processor Sharing in Fork-Join Queues;Quantitative Evaluation of Systems;2018
5. Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations;Quantitative Evaluation of Systems;2016