{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1099892","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1099892","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1099892","kernelVersion":"v1","immutable":true,"modified":"2026-01-06T16:29:25Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1099892","name":"A two-queue system with alternating service","headline":"A two-queue system with alternating service","description":"scientific article; zbMATH DE number 4043004","url":"https://portal.mardi4nfdi.de/entity/Q1099892","datePublished":"1987-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1099891"},{"@id":"https://portal.mardi4nfdi.de/entity/Q595489"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q109332"}],"comment":"We analyze a queueing system with two types of customers, one server, exponentially distributed service time, and Poisson inputs, whose parameters (customer arrival and service rates) depend on the current queue length. Efficient recursive methods are proposed for calculating nonembedded stationary state probabilities, stationary probabilities at the arrival moments, and the moments of the distribution functions of the sojourn time in the system. The results may be applied to estimate the efficiency of some MIS operating in an interactive multiuser mode."},"provenance":{"prov:generatedAtTime":"2026-01-06T16:29:25Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}