Pages that link to "Item:Q2270323"
From MaRDI portal
The following pages link to Parallel machine scheduling with nested job assignment restrictions (Q2270323):
Displaying 18 items.
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← 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)
- Vertex ordering with precedence constraints (Q6546603) (← links)
