Pages that link to "Item:Q280944"
From MaRDI portal
The following pages link to Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944):
Displaying 11 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- (Q2948897) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
