On a periodic maintenance problem

Authors:
W.D Wei;C.L Liu
Affiliations:
Department of Mathematics, Sichuan University, People's Republic of China and Department of Computer Science, University of Illinois, Urbana-Champaign, IL 61801, U.S.A.;Department of Computer Science, University of Illinois, Urbana-Champaign, IL 61801, U.S.A.
Venue:
Operations Research Letters
Year:
1983

Citing 1
Cited 3

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

Adaptive general perfectly periodic scheduling

Information Processing Letters
Bandwidth allocation for isochronous connections in DQDB using the PA scheme

Computer Communications
A branch and bound algorithm for the response time variability problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a machine maintenance problem, in which n machines are to be served on a regular, periodic basis, is studied. In particular, we are interested in how the maintenance cycles of the machines can be initiated so that all service requirements can be fulfilled by k servers.