Sequencing and scheduling \(N\) customers for a stochastic server
type: Item
instance of: scholarly article
title: Sequencing and scheduling \(N\) customers for a stochastic server
zbMATH Open document ID: 0945.90015
DOI: 10.1016/S0377-2217(98)00340-3
published in: European Journal of Operational Research
publication date: 2000-10-11T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 62M05
zbMATH DE Number: 1370735
zbMATH Keywords: Markov chains
zbMATH Keywords: queueing
zbMATH Keywords: scheduling theory
author: Pu Patrick Wang
MaRDI profile type: Publication
cites work: Q3359644
cites work: Q3688092
cites work: Transient analysis of acyclic markov chains
cites work: Q3923308
cites work: Q5289008
cites work: Q4697329
cites work: Optimally scheduling \(N\) customer arrival times for a single-server system
description: scientific article; zbMATH DE number 1370735