1. Queueing Networks with Blocking;I Adan,1988
2. Altiok, T., and H. G. Perros, 1987, Approximate Analysis of Arbitrary Configurations of Open Queueing Networks with Blocking, Annals of O.R., Vol. 9, pp. 481–509.
3. Ammar, M. H., and S. B. Gershwin, 1989, Equivalence Relations in Queueing Models of Assembly/Disassembly Networks, Performance Evaluation, Vol. 10, pp. 233–245.
4. Avi-Itzhak, B., and S. Halfin, 1991 a, Non-Preemptive Priorities in Simple Fork-Join Queues, Queueing, Performance and Control in ATM,ITC-13 (Cohen and Pack, eds.). Elsevier Science Publishers, New York.
5. Avi-Itzhak, B., and S. Halfin, 1991b, Priorities in Simple Fork-Join Queues, RUTCOR Research Report No. 32–91, Rutgers University, Piscataway, New Jersey.