Pages that link to "Item:Q410716"
From MaRDI portal
The following pages link to Fast approximation algorithms for job scheduling with processing set restrictions (Q410716):
Displayed 4 items.
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)