A Note on One-Machine Scheduling Problems with Imperfect Information

DOI10.1017/S0269964800002114MaRDI QIDQ3416016zbMATH OpenFDO

Authors J. B. G. Frenk

Publication date 19 January 2007

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

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

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic scheduling theory in operations research (90B36)

Cites work

• Bounds, inequalities, and monotonicity properties for some specialized renewal processes
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• scientific article; zbMATH DE number 3852171 (Why is no real title available?)
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 3348735 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Inequalities for stochastic flow shops and job shops
• On maximal sets of functions compatible with a partial ordering for distribution functions

This page was built for publication: A Note on One-Machine Scheduling Problems with Imperfect Information

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