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):
Displaying 14 items.
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
