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 problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In...
We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time a...
We discuss several open problems in the area of machine scheduling that concern the computational co...
We survey and extend the results on the complexity of machine scheduling problems. After a brief rev...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
textabstractWe identify two classes of machine scheduling problems with time lags that possess Polyn...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In...
We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time a...
We discuss several open problems in the area of machine scheduling that concern the computational co...
We survey and extend the results on the complexity of machine scheduling problems. After a brief rev...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
textabstractWe identify two classes of machine scheduling problems with time lags that possess Polyn...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In...
DOI
Add to ORKG