Jurisch Bernd

Bernd Jurisch

Information about the author Bernd Jurisch will soon be added to the site.
Found 6 papers in total
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...
Lower bounds for the job-shop scheduling problem on multi-purpose machines
Lower bounds for the job-shop scheduling problem on multi-purpose machines
1995
The job-shop problem on multi-purpose machines (MPM job-shop problem) arises in the...
Scheduling shops to minimize the weighted number of late jobs
Scheduling shops to minimize the weighted number of late jobs
1994
The problem of scheduling jobs with a common due date d so that the weighted number of...
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...
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...
Papers per page: