We consider the problem of scheduling tasks on a single machine to minimize the flowtime. The machine is subject to breakdowns during the processing of the tasks. The breakdowns occur at a randomâ€¦ (More)

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the sameâ€¦ (More)

This paper deals wi th a single server s t a t ion del ivering service to m pr ior i ty classes (m might be finite or infinite). The arr ival process of customers from a j t h (j = 1, 2 , . . . , m)â€¦ (More)

A simple computer system is described, which consists of a CPU and I/O unit and which works in a multiprogramming manner. The model assumes that the system works under heavy load so that the incomingâ€¦ (More)

The paper deals with computer time-sharing disciplines in which external priorities are introduced. For a computer system under a time-sharing discipline, the following priority disciplines areâ€¦ (More)

This paper deals with a single-server station (a computer) where each customer's demand comprises an independent random number of jobs (programs). Under certain assumptions, two cyclic disciplinesâ€¦ (More)

This note deals wi th t ime-shar ing disciplines where the arr ival process is homogeneous Poisson and service requi rements are exponent ia l ly d is t r ibuted . The inves t iga ted regimes are:â€¦ (More)