SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
DOI10.1142/S0129054104002480zbMATH Open1067.68026MaRDI QIDQ3022006FDOQ3022006
Authors: Monaldo Mastrolilli 
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Scheduling to minimize max flow time: offline and online algorithms.
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Minimizing maximum flow-time on related machines
- Minimizing Maximum Flow-time on Related Machines
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
approximation algorithmsparallel machines schedulingmax flow time minimizationon-line and off-line algorithms
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation algorithms for scheduling unrelated parallel machines
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Cited In (11)
- Title not available (Why is that?)
- Online scheduling to minimize maximum response time and maximum delay factor
- Scheduling to minimize max flow time: offline and online algorithms.
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling chains to minimize mean flow time
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
- Minimizing the maximum flow time in batch scheduling
- Algorithms for Flows over Time with Scheduling Costs
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
- Minimizing the maximum flow time in the online food delivery problem
This page was built for publication: SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022006)
