Krmer Andreas

Andreas Krmer

Information about the author Andreas Krmer will soon be added to the site.
Found 4 papers in total
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
1996
Resource-constrained scheduling problems with a fixed number of task types are...
Complexity of scheduling problems with multi-purpose machines
Complexity of scheduling problems with multi-purpose machines
1997
In a multi-purpose machine scheduling problem, jobs or operations can be processed by...
Shop scheduling problems with multiprocessor tasks on dedicated processors
Shop scheduling problems with multiprocessor tasks on dedicated processors
1995
The computational complexity of shop scheduling problems with multiprocessor tasks on...
The job-shop problem and immediate selection
The job-shop problem and immediate selection
1994
The job-shop problem is one of the most difficult NP-hard scheduling problems. A...
Papers per page: