Abstract
We investigate the max flow time scheduling problem in the off-line and on-line setting. We prove positive and negative theoretical results. In the off-line setting, we address the unrelated parallel machines model and present the first known fully polynomial time approximation scheme, when the number of machines is fixed. In the on-line setting and when the machines are identical, we analyze the First In First Out (FIFO) heuristic when preemption is allowed. We show that FIFO is an on-line algorithm with a (3-2/m)-competitive ratio. Finally, we present two lower bounds on the competitive ratio of deterministic on-line algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.