Pages that link to "Item:Q684343"
From MaRDI portal
The following pages link to On the computational complexity of (maximum) shift class scheduling (Q684343):
Displaying 8 items.
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach (Q5357767) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)