Pages that link to "Item:Q5945393"

The following pages link to Semi-on-line scheduling with ordinal data on two uniform machines (Q5945393):

Displaying 12 items.

• Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
• Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
• Semi-online scheduling with machine cost. (Q1433957) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
• Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
• \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
• Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)