Bernd Jurisch

Available identifiers

Publication	Date of Publication	Type
A branch \(\&\) bound algorithm for the open-shop problem	1998-02-24	Paper
Complexity of scheduling problems with multi-purpose machines	1997-12-04	Paper
Two-Machine Open Shops with Renewable Resources	1997-11-12	Paper
Algorithms for minclique scheduling problems	1997-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q4882527	1996-06-17	Paper
Lower bounds for the job-shop scheduling problem on multi-purpose machines	1996-03-18	Paper
Scheduling shops to minimize the weighted number of late jobs	1995-05-28	Paper
The job-shop problem and immediate selection	1994-12-01	Paper
A branch and bound algorithm for the job-shop scheduling problem	1994-07-18	Paper
Tabu search for the job-shop scheduling problem with multi-purpose machines	1994-04-26	Paper
Scheduling unit time open shops to minimize the weighted number of late jobs	1994-04-06	Paper
A new lower bound for the job-shop scheduling problem	1993-06-29	Paper
Open shop problems with unit time operations	1993-05-03	Paper

This page was built for person: Bernd Jurisch