The following pages link to Reinhard Bürgy (Q247826):
Displaying 10 items.
- The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A decomposition-based heuristic for large employee scheduling problems with inter-department transfers (Q2175366) (← links)
- The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
- Optimal job insertion in the no-wait job shop (Q2392741) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
- A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection (Q6410092) (← links)
- A facility location problem with minimum workload and penalties for waste collection (Q6606636) (← links)
