Pages that link to "Item:Q766186"
From MaRDI portal
The following pages link to An efficient algorithm for finding ideal schedules (Q766186):
Displaying 5 items.
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
