Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …

High-performance computing (HPC) systems are growing more powerful by utilizing more
hardware components. As the system mean-time-before-failure correspondingly drops …

hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems,
in general, consist in the allocation of resources over time in order to perform a set of jobs …

In the single-machine non-clairvoyant scheduling problem, the goal is to minimize the total
completion time of jobs whose processing times are unknown a priori. We revisit this well …

As a growing number of manufacturers adopt the make-to-order business mode and a
growing number of retailers sell online, we are seeing numerous decision problems that can …

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

As clusters continue to grow in size and complexity, providing scalable and predictable
performance is an increasingly important challenge. A crucial roadblock to achieving …

Guaranteed quality of service is one of the most challenging aspects in many areas of
computer science. In areas like networks and parallel computing, guaranteeing high …

We survey recent research that has appeared in the theoretical computer science literature
on algorithmic problems related to power management. We will try to highlight some open …

In non-clairvoyant scheduling, the task is to find an online strategy for scheduling jobs with a
priori unknown processing requirements with the objective to minimize the total (weighted) …