Minimizing the maximum flow time in batch scheduling
From MaRDI portal
Recommendations
- Batch scheduling on uniform machines to minimize total flow-time
- Batch scheduling with step-deteriorating processing times to minimize flowtime
- Minimizing Schedule Length Subject to Minimum Flow Time
- Batch scheduling to minimize maximum lateness
- scientific article; zbMATH DE number 5059917
- Batch scheduling to minimize total completion time
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
- Minimizing flow-time on a single machine with integer batch sizes
- Scheduling chains to minimize mean flow time
- Scheduling to minimize max flow time: offline and online algorithms.
Cites work
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
- Broadcast scheduling, algorithms and complexity
- New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding
- New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)
- Online scheduling to minimize maximum response time and maximum delay factor
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Speed is as powerful as clairvoyance
- Throughput maximization of real-time scheduling with batching
Cited in
(8)- scientific article; zbMATH DE number 7070855 (Why is no real title available?)
- Minimizing Average Flow-Time
- Rejecting jobs to Minimize Load and Maximum Flow-time
- Scheduling chains to minimize mean flow time
- Batch scheduling on uniform machines to minimize total flow-time
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- scientific article; zbMATH DE number 5059917 (Why is no real title available?)
- Minimizing total flow time and total completion time with immediate dispatching
This page was built for publication: Minimizing the maximum flow time in batch scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709967)
