Pages that link to "Item:Q5704856"

The following pages link to Optimal non-preemptive semi-online scheduling on two related machines (Q5704856):

Displaying 13 items.

• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← links)
• Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
• Online scheduling with a buffer on related machines (Q711400) (← links)
• Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
• Semi-online machine covering for two uniform machines (Q1034625) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
• Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)