The following pages link to Bernd Jurisch (Q242832):
Displayed 13 items.
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Complexity of scheduling problems with multi-purpose machines (Q1374420) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- Two-Machine Open Shops with Renewable Resources (Q4363756) (← links)
- (Q4882527) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)