A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

27 July 1991

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

Vol. 5 (3) , 297-315
https://doi.org/10.1017/s0269964800002102

Abstract

In this paper we present a general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering and review and extend some of the results for nonpreemptive permutation schedules recently obtained for these models.

Keywords

SCHEDULES
GENERAL FRAMEWORK
NONPREEMPTIVE
PERMUTATION
MACHINE SCHEDULING PROBLEMS
STOCHASTIC ONE MACHINE

This publication has 1 reference indexed in Scilit:

Stochastic Systems: Modeling, Identification and Optimization, I
Published by Springer Nature ,1976