Software/Data

• Code of a branch & bound algorithm for the job shop problem
  (see: Discrete Applied Mathematics 49 (1994) 107-127)
• New benchmark instances for the open shop problem
  (see: Discrete Applied Mathematics 76 (1997) 43-59)
• Benchmark instances for the job-shop problem with multi-purpose machines
  (see OR-Spektrum 15 (1994) 205-215)
• Benchmark instances for the multi-mode job-shop problem
  (see OR-Spektrum 20 (1998) 21-28)
• Results (Lower and upper bounds) for resource-constrained project scheduling problems (RCPSP, RCPSP/max, MRCPSP/max)
  
• Benchmark instances for an auditing problem
  
• Benchmark instances and results for scheduling a robot in a job-shop environment
  
• Test instances and results for the flow-shop problem with intermediate buffers