Pages that link to "Item:Q1767979"
From MaRDI portal
The following pages link to Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979):
Displaying 5 items.
- Machine covering with combined partial information (Q972842) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines (Q2463519) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
