Abstract

Consideration was given to the closed queuing network with batch jockeying customers. This network extends the Gordon-Newell model to the case of batch customer servicing. The serviced batch discharges a node without changing its size and arrives to another node with a probability depending on its size. Some constraints must be imposed on the servicing process. The form of the stationary distribution was established, and an efficient algorithm to determine it was proposed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: 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.