SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS

DOI10.1142/S0129054104002480zbMath1067.68026MaRDI QIDQ3022006

Monaldo Mastrolilli

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsparallel machines schedulingmax flow time minimizationon-line and off-line algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Minimizing the maximum flow time in the online food delivery problem ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times ⋮ On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

This page was built for publication: SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS