Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …

A state-of-the-art review of parallel-machine scheduling research Page 1 European Journal of
Operational Research 47 (1990) 271-292 271 North-Holland Invited Review A state-of-the-art …

The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. In this paper we survey the state of the art with respect to optimization and …

Existing deep learning systems commonly parallelize deep neural network (DNN) training
using data or model parallelism, but these strategies often result in suboptimal …

Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …

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 …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. We survey the state of the art with respect to optimization and approximation …

We consider the problem of scheduling a partially ordered set of unit execution time (UET)
tasks on m> 1 processors where there is a communication delay of unit time between any …

We discuss what we consider to be the 10 most vexing open questions in the area of
polynomial time approximation algorithms for NP‐hard deterministic machine scheduling …