Brucker Peter

Peter Brucker

Information about the author Peter Brucker will soon be added to the site.
Found 35 papers in total
A branch and bound algorithm for the resource-constrained project scheduling problem
A branch and bound algorithm for the resource-constrained project scheduling problem
1998
A branch and bound algorithm is presented for the resource-constrained project...
Batch scheduling with deadlines on parallel machines
Batch scheduling with deadlines on parallel machines
1998
The problem of scheduling G groups of jobs on m parallel machines is considered. Each...
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...
A Monge property for the d-dimensional transportation problem
A Monge property for the d-dimensional transportation problem
1995
In 1963, Hopman gave necessary and sufficient conditions under which a family of O(...
A new lower bound for the job-shop scheduling problem
A new lower bound for the job-shop scheduling problem
1993
A new lower bound for the job-shop scheduling problem is developed. This lower bound...
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...
Series parallel composition of greedy linear programming problems
Series parallel composition of greedy linear programming problems
1993
The authors study the concept of series and parallel composition of linear programming...
Scheduling unit time open shops to minimize the weighted number of late jobs
Scheduling unit time open shops to minimize the weighted number of late jobs
1993
The authors present a polynomial algorithm for the problem of scheduling an open shop...
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...
The complexity of one-machine batching problems
The complexity of one-machine batching problems
1993
Batching problems are combinations of sequencing and partitioning problems. For each...
Papers per page: