One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1016/0305-0548(94)00071-f
Copy DOI
Export
Save
Share
Cite Journal: Computers and Operations Research |  Publication Date: Oct 1, 1995 |
 Citations: 10 |
Affiliation: University at Buffalo, State University of New York
An efficient iterative algorithm is developed for computing the stationary queue length distribution in M/ G/1/ N queues with setup time and arbitrary state dependent arrival rates. The overall computation of the algorithm is O( N 2) in complexity. Our numerical investigations demonstrate the strength of the algorithm.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
