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):
Displaying 12 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← 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)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- A best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
- On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
