Customer scheduling with incomplete information

DOI10.1017/S0269964800003855zbMATH Open1335.90042MaRDI QIDQ2805328FDOQ2805328

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)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (2)

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

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)