Pages that link to "Item:Q1886493"

The following pages link to A note on on-line scheduling with partial information (Q1886493):

Displaying 9 items.

• Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
• Online scheduling with a buffer on related machines (Q711400) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
• Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
• Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)