Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This tutorial provides an introduction into the area of polynomial time approximation
schemes. The underlying ideas, the main tools, and the standard approaches for the …

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 …

Flows over time (also called dynamic flows) generalize standard network flows by
introducing an element of time. They naturally model problems where travel and …

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

Abstract We present Branch-and-Check, a hybrid framework integrating Mixed Integer
Programming and Constraint Logic Programming, which encapsulates the traditional …

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 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 …

The map-reduce paradigm is now standard in industry and academia for processing large-
scale data. In this work, we formalize job scheduling in map-reduce as a novel …