Customer Scheduling with Incomplete Information

DOI10.1017/S0269964800003855zbMath1335.90042MaRDI QIDQ2805328

Ulrich Rieder, Jürgen Roland Weishaupt

Publication date: 11 May 2016

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Structured policies in the sequential design of experiments
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
• The cμ rule revisited
• Bayesian dynamic programming
• Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
• On Bayesian models in stochastic scheduling
• On the optimal allocation of two or more treatments in a controlled clinical trial
• Optimal myopic policies and index policies for stochastic scheduling problems

This page was built for publication: Customer Scheduling with Incomplete Information