Pages that link to "Item:Q1013450"
From MaRDI portal
The following pages link to Online scheduling of two uniform machines to minimize total completion times (Q1013450):
Displaying 20 items.
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
- Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← links)
- Preemptive stochastic online scheduling on two uniform machines (Q976122) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Scheduling uniform machines on-line requires nondecreasing speed ratios (Q1290644) (← links)
- Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- (Q4252304) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
