Minimizing average flow-time under knapsack constraint

DOI10.1016/j.tcs.2015.04.031zbMath1333.68075OpenAlexW2041936312MaRDI QIDQ896150

Suman K. Bera, Amit Kumar, Syamantak Das

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.031

zbMATH Keywords

multiprocessor schedulingapproximation algorithmsaverage flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Minimizing average flow time on related machines
• A robust maximum completion time measure for scheduling
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Scheduling with Outliers
• Techniques for scheduling with rejection
• Algorithms - ESA 2003

This page was built for publication: Minimizing average flow-time under knapsack constraint