On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity

A model of a single-machine production system with finite magazine capacity is investigated. The input flow of jobs is organized according to geometric distribution of interarrival times, while processing times are assumed to be generally distributed. The closed-form formula for the generating funct...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical modelling and analysis Ročník 25; číslo 2; s. 289 - 302
Hlavní autor: Kempa, Wojciech M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Vilnius Vilnius Gediminas Technical University 01.03.2020
Témata:
Algebra
buffer overflow
Buffers
Discrete time systems
Finite capacity
geometric distribution
Linear algebra
Markov analysis
Markov chains
Markov processes
production line
Production management
queueing model
Queuing theory
Time
transient analysis
transient analysis
queueing model
buffer overflow
production line
geometric distribution
ISSN:1392-6292, 1648-3510
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A model of a single-machine production system with finite magazine capacity is investigated. The input flow of jobs is organized according to geometric distribution of interarrival times, while processing times are assumed to be generally distributed. The closed-form formula for the generating function of the time to the first buffer overflow distribution conditioned by the initial buffer state is found. The analytical approach based on the idea of embedded Markov chain, the formula of total probability and linear algebra is applied. The corresponding result for next buffer overflows is also given. Numerical examples are attached as well.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1392-6292
1648-3510
DOI:10.3846/mma.2020.10433