Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities

Authors:
Wei Li; Jinhua Cao
Affiliations:
Institute of Applied Mathematics, Academia Sinica, Beijing, 100080, People's Republic of China and Open Laboratory on the Complex System Control, Institute of Automation, Academia Sinica, Beijing, ...;Institute of Applied Mathematics, Academia Sinica, Beijing, 100080, People's Republic of China
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 3

Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Integrated production planning and preventive maintenance in deteriorating production systems

Information Sciences: an International Journal
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks
Minimizing makespan on a single machine subject to random breakdowns

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of stochastic jobs is to be processed on a single machine which is subject to several types of breakdowns according to different probabilities. After the machine fails, jobs' processing time, uptime and repair time of the machine may be different from the original period. We find the optimal nonpreemptive policies that minimize the following objective functions: (1) the weighted sum of the completion times, (2) the weighted number of late jobs having constant due dates, (3) the weighted number of late jobs having random due dates. These results partly generalize the conclusions obtained by Pinedo and Rammouz (1988) and Xie and Zheng (1993).