Analysis of a finite-source customer assignment model with no state information

DOI10.1007/BF01194403MaRDI QIDQ1298752zbMATHFDO

Authors Arie Hordijk, Anneke Loeve, Jeroen Tiggelman

Publication date 22 August 1999

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

parallel queuesclosed queueing networkexponential service timesaverage optimal policy

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 1031394
• Customer-oriented finite perturbation analysis for queueing networks
• Optimal service assignment in a finite-source queue
• scientific article; zbMATH DE number 967318
• scientific article; zbMATH DE number 1101605
• Deterministic allocation models for multi-period demand fulfillment in multi-stage customer hierarchies
• Finite source Markovian inventory system with bonus service for certain customers
• Approximate analysis for queueing networks with finite capacity and customer loss

Cites work

• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• Markovian network processes: Congestion-dependent routing and processing
• Optimal static customer routing in a closed queuing network
• Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy

Cited in

(2)

• Improving routing decisions in parallel non-observable queues
• scientific article; zbMATH DE number 1101605 (Why is no real title available?)

This page was built for publication: Analysis of a finite-source customer assignment model with no state information

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