This paper surveys the literature related to solving traditional unrelated parallel-machine
scheduling problems. It compiles algorithms for the makespan, total weighted sum of …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

We consider the problem of scheduling unrelated parallel machines subject to release dates
so as to minimize the total weighted completion time of jobs. The main contribution of this …

We study approximation algorithms for problems of scheduling precedence constrained jobs
with the objective of minimizing total weighted completion time, in identical and related …

We consider a model for scheduling under uncertainty. In this model, we combine the main
characteristics of online and stochastic scheduling in a simple and natural way. Job …

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra,
Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated …

We consider a class of non-identical parallel-machine scheduling problems in which the
goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and …

We consider the scheduling problem of minimizing the average-weighted completion time
on identical parallel machines when jobs are arriving over time. For both the preemptive and …

We consider the problem of scheduling jobs on unrelated machines so as to minimize the
sum of weighted completion times. Our main result is a (3/2-c)-approximation algorithm for …

We consider the problem of scheduling jobs arriving over time in a multiprocessor setting,
with immediate dispatching, disallowing job migration. The goal is to minimize both the total …