A regularly preemptive model and its approximations

DOI10.1023/A:1020953726925MaRDI QIDQ1854725zbMATH OpenOpenAlexFDO

Authors Fumiaki Machihara, Yuichi Aono

Publication date 27 January 2003

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020953726925

zbMATH Keywords

busy periodMarkov renewal processwaiting timepiecewise Markov processregular preemption

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 967316
• A PREEMPTIVE PRIORITY QUEUE AS A MODEL WITH SERVER VACATIONS
• The MAP, M/G₁,G₂/1 queue with preemptive priority
• The nonpreemptive priority MAP/G/1 queue
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes

This page was built for publication: A regularly preemptive model and its approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854725)