Pages that link to "Item:Q398877"

The following pages link to Semi-online scheduling problems on a small number of machines (Q398877):

Displaying 7 items.

• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
• Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
• Bin stretching with migration on two hierarchical machines (Q6093406) (← links)