Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …

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 …

Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …

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

Scheduling problems can be understood in general as the problems of allocating resources
over time to perform a set of tasks being parts of some processes, among which …

To reduce the impact of network congestion on big data jobs, cluster management
frameworks use various heuristics to schedule compute tasks and/or network flows. Most of …

The scheduling of jobs on parallel supercomputer is becoming the subject of much research.
However, there is concern about the divergence of theory and practice. We review …

The imprecise computation technique ensures that all time-critical tasks produce their results
before their deadlines by trading off the quality of the results for the computation time …

Multiprocessor tasks require more than one processor at the same moment of time. This
relatively new concept in scheduling theory emerged with the advent of parallel computing …

Approximate algorithms scheduling parallelizable tasks Page 1 Approximate Algorithms for
Scheduling Parallelizable Tasks Abstrect John Turek jjt@watson.ibm.com Joel L. Wolf jlw@watson …