The following pages link to (Q4708574):
Displaying 6 items.
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
