A Note on One-Machine Scheduling Problems with Imperfect Information

27 July 1991

journal article
research article
Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences

Vol. 5 (3) , 317-331
https://doi.org/10.1017/s0269964800002114

Abstract

In this paper we consider one-machine scheduling problems with or without a perfect machine and random processing times and derive among other results elimination criteria for different classes of cost functions.

Keywords

IMPERFECT INFORMATION

This publication has 8 references indexed in Scilit:

A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
Probability in the Engineering and Informational Sciences, 1991
Single-machine scheduling subject to stochastic breakdowns
Naval Research Logistics (NRL), 1990
A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
Probability in the Engineering and Informational Sciences, 1988
Inequalities for stochastic flow shops and job shops
Applied Stochastic Models and Data Analysis, 1986
Stochastic Scheduling with Release Dates and Due Dates
Operations Research, 1983
On maximal sets of functions compatible with a partial ordering for distribution functions
Mathematische Operationsforschung und Statistik. Series Optimization, 1981
Bounds, Inequalities, and Monotonicity Properties for Some Specialized Renewal Processes
The Annals of Probability, 1980
Minimizing Total Costs in One-Machine Scheduling
Operations Research, 1975