A Markov chain description of a workstation with infinite capacity

DC FieldValueLanguage
dc.contributor.authorStadje, W
dc.date.accessioned2021-12-23T16:01:08Z-
dc.date.available2021-12-23T16:01:08Z-
dc.date.issued2003
dc.identifier.issn02331934
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/4782-
dc.description.abstractWe present a discrete-time model for a workstation with infinite operating capacity at which one job arrives at every time instant and starts being processed. The jobs stay in the system for a possibly truncated geometrically distributed time period. We introduce and analyze a Markov chain which gives at any time a complete description of the state of the work on all jobs. Its positively recurrent states are the dyadic numbers in (0, 1]; we give its stationary distribution explicitly. For the busy period analysis of the workstation we study first-entrance problems of this Markov chain.
dc.language.isoen
dc.publisherTAYLOR & FRANCIS LTD
dc.relation.ispartofOPTIMIZATION
dc.subjectbusy period
dc.subjectdiscrete time
dc.subjectfirst-entrance problem
dc.subjectinfinite capacity
dc.subjectMarkov chain
dc.subjectMathematics
dc.subjectMathematics, Applied
dc.subjectmaximum occupation
dc.subjectOperations Research & Management Science
dc.subjectQUEUES
dc.subjectstationary distribution
dc.subjectworkstation
dc.titleA Markov chain description of a workstation with infinite capacity
dc.typejournal article
dc.identifier.doi10.1080/0233193031000079847
dc.identifier.isiISI:000182367400006
dc.description.volume52
dc.description.issue2
dc.description.startpage201
dc.description.endpage210
dc.publisher.place4 PARK SQUARE, MILTON PARK, ABINGDON OX14 4RN, OXON, ENGLAND
dcterms.isPartOf.abbreviationOptimization
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidStWo325-
Show simple item record

Google ScholarTM

Check

Altmetric