Brucker P.

P. Brucker

Information about the author P. Brucker will soon be added to the site.
Found 10 papers in total
Flowshop problems with intermediate buffers
Flowshop problems with intermediate buffers
2003
In this paper the following extension of the classical flowshop problem is considered:...
A polynomial algorithm for P|pj = 1, rj, outtree |ΣCj
A polynomial algorithm for P|pj = 1, rj, outtree |ΣCj
2002
A polynomial algorithm is proposed for two scheduling problems for which the...
Scheduling railway traffic at a construction site
Scheduling railway traffic at a construction site
2002
We consider the problem of rescheduling trains in the case where one track of a...
Scheduling unit execution time task systems with concurrency on two parallel identical processors
Scheduling unit execution time task systems with concurrency on two parallel identical processors
2000
Problems with unit execution time tasks and two identical parallel processors have...
A branch & bound method for the general-shop problem with sequence dependent setup-times
A branch & bound method for the general-shop problem with sequence dependent setup-times
1996
A branch & bound algorithm is presented for a very general scheduling problem with...
On the complexity of two machine job-shop scheduling with regular objective functions
On the complexity of two machine job-shop scheduling with regular objective functions
1997
For the nonpreemptive two machine job-shop scheduling problem with a fixed number of...
Single machine batch scheduling to minimize the weighted number of late jobs
Single machine batch scheduling to minimize the weighted number of late jobs
1996
The single machine batch scheduling problem to minimize the weighted number of late...
A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
1994
It is shown that the job-shop problem with two machines and a fixed number of k jobs...
Open shop problems with unit time operations
Open shop problems with unit time operations
1993
The authors show that the m- machine open shop problem in which all operations have...
A characterization of network representable polymatroids
A characterization of network representable polymatroids
1991
Meggido showed that the maximum flow through sets of sources in a multiple sink flow...
Papers per page: