Optimal server assignment for a multiple customer classes problem

DOI10.1093/IMAMAN/15.3.195MaRDI QIDQ4659862zbMATH OpenOpenAlexFDO

Authors

Publication date 21 March 2005

Published in IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imaman/15.3.195

zbMATH Keywords

assignment problemoptimal schedulingqueuing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Programming involving graphs or networks (90C35)

Recommendations

• Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
• On Server Allocation in Multiple Center Manufacturing Systems
• scientific article; zbMATH DE number 836622
• Optimal assignment of ordered jobs
• Analysis of job assignment with batch arrivals among heterogeneous servers

Cited in

(4)

• On the optimal allocation of customers that must depart in sequence
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
• Prioritized customer order scheduling to maximize throughput
• scientific article; zbMATH DE number 6452758 (Why is no real title available?)

This page was built for publication: Optimal server assignment for a multiple customer classes problem

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