Pages that link to "Item:Q2566928"
From MaRDI portal
The following pages link to Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928):
Displayed 12 items.
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)