Pages that link to "Item:Q829170"
From MaRDI portal
The following pages link to Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170):
Displaying 12 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (Q2392745) (← 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 Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
