Pages that link to "Item:Q537921"

The following pages link to Semi-online preemptive scheduling: one algorithm for all variants (Q537921):

Displaying 4 items.

• Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)