Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
From MaRDI portal
(Redirected from Publication:829170)
Recommendations
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- scientific article; zbMATH DE number 6490206
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
Cites work
- scientific article; zbMATH DE number 6490206 (Why is no real title available?)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
- A note on special optimal batching structures to minimize total weighted completion time
- Algorithms for minimizing weighted flow time
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- Makespan minimization in online scheduling with machine eligibility
- Minimizing weighted flow time
- On-line algorithms for minimizing makespan on batch processing machines
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Online weighted flow time and deadline scheduling
- Scheduling a batching machine
Cited in
(15)- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- scientific article; zbMATH DE number 6490206 (Why is no real title available?)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Online batch-machine scheduling to maximize total weight of the accepted jobs
- scientific article; zbMATH DE number 2081006 (Why is no real title available?)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
This page was built for publication: Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829170)
