A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- 1 January 1988
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 2 (1) , 41-49
- https://doi.org/10.1017/s0269964800000619
Abstract
This paper considers a single machine and n jobs. The machine is subject to breakdown and repair. Job j has a weight wj, a random processing time Xj, and is available for processing from a random time Rj on. The jobs may be subject to precedence constraints. We are interested in optimal policies that minimize the following objective functions: (i) the weighted sum of the completion times; (ii) the weighted sum of an exponential function of the completion times; and (iii) the weighted number of late jobs having due dates.Keywords
This publication has 12 references indexed in Scilit:
- Scheduling stochastic jobs on a single machine subject to breakdownsNaval Research Logistics Quarterly, 1984
- Stochastic Scheduling with Release Dates and Due DatesOperations Research, 1983
- On nonpreemptive strategies in stochastic schedulingNaval Research Logistics Quarterly, 1981
- Sequencing with Series-Parallel Precedence ConstraintsMathematics of Operations Research, 1979
- A Renewal Decision ProblemManagement Science, 1978
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence ConstraintsPublished by Elsevier ,1978
- Multiple feedback at a single-server stationStochastic Processes and their Applications, 1977
- On Scheduling Chains of Jobs on One Processor with Limited PreemptionSIAM Journal on Computing, 1975
- N-Job, One Machine Sequencing Problems Under UncertaintyManagement Science, 1973
- Single Facility Sequencing with Random Execution TimesOperations Research, 1965