Pages that link to "Item:Q1762979"
From MaRDI portal
The following pages link to Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979):
Displaying 11 items.
- Semi-online scheduling revisited (Q442235) (← links)
- 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)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
