Veltman B.

B. Veltman

Information about the author B. Veltman will soon be added to the site.
Found 3 papers in total
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
1996
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine...
Three, four, five, six, or the complexity of scheduling with communication delays
Three, four, five, six, or the complexity of scheduling with communication delays
1994
A set of unit-time tasks has to be processed on identical parallel processors subject...
Cooperation in one machine scheduling
Cooperation in one machine scheduling
1993
A combinatorial optimization problem can often be understood as the problem to...
Papers per page: