Pages that link to "Item:Q4147822"
From MaRDI portal
The following pages link to Minimal Resources for Fixed and Variable Job Schedules (Q4147822):
Displayed 15 items.
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Vehicles scheduling with sliding time windows (Q1120470) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
- Maximizing the value of a space mission (Q1342007) (← 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)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)