Pages that link to "Item:Q1010275"
From MaRDI portal
The following pages link to On-line scheduling of parallel machines to minimize total completion times (Q1010275):
Displayed 4 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)