Pages that link to "Item:Q706379"
From MaRDI portal
The following pages link to Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time (Q706379):
Displaying 10 items.
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← 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)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
