Pages that link to "Item:Q1207538"
From MaRDI portal
The following pages link to License class design: Complexity and algorithms (Q1207538):
Displaying 8 items.
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)