Customer scheduling with incomplete information

DOI10.1017/S0269964800003855MaRDI QIDQ2805328zbMATH OpenFDO

Authors Ulrich Rieder, Jürgen Weishaupt

Publication date 11 May 2016

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800003855

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal stochastic scheduling
• Optimal myopic policies and index policies for stochastic scheduling problems
• Scheduling services in a queuing system with impatience and setup costs
• Scheduling arrivals to a stochastic service mechanism
• Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information

Cites work

• Bayesian dynamic programming
• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• scientific article; zbMATH DE number 194374 (Why is no real title available?)
• On Bayesian models in stochastic scheduling
• On the optimal allocation of two or more treatments in a controlled clinical trial
• Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
• Optimal myopic policies and index policies for stochastic scheduling problems
• Structured policies in the sequential design of experiments
• The cμ rule revisited
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal

Cited in

(2)

• Scheduling and Outsourcing with Multiple Customers
• A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

This page was built for publication: Customer scheduling with incomplete information

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