The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

In this paper, we consider two fundamental multiprocessor scheduling problems: q on-line
multiprocessor scheduling of sequential jobs in a hard-real-time environment, in which all …

Scheduling has become a major field within operational research with several hundred
publications appearing each year. This paper explores the historical development of the …

We consider the problem of nonpreemptive scheduling to minimize average (weighted)
completion time, allowing for release dates, parallel machines, and precedence constraints …

A natural and basic problem in scheduling theory is to provide good average quality of
service to a stream of jobs that arrive over time. In this paper we consider the problem of …

This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which
service requests arrive in real time. The hybrid algorithm combines an exact constraint …

We consider the scheduling problem of minimizing the average weighted completion time of
n jobs with release dates on a single machine. We first study two linear programming …

We present a new class of randomized approximation algorithms for unrelated parallel
machine scheduling problems with the average weighted completion time objective. The key …

Motivated by applications in the manufacturing and service industries, we consider two
models for coordinating scheduling with lead-time quotation: a basic model with a single …