Minimizing average flow-time under knapsack constraint

DOI10.1016/J.TCS.2015.04.031MaRDI QIDQ896150zbMATH OpenOpenAlexFDO

Authors Suman K. Bera, Syamantak Das, Amit Kumar

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

approximation algorithmsmultiprocessor schedulingaverage 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)

Recommendations

• Minimizing average flow-time under knapsack constraint
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing average flow time on related machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Minimizing Total Flow-Time: The Unrelated Case

Cites work

• scientific article; zbMATH DE number 437570 (Why is no real title available?)
• scientific article; zbMATH DE number 871904 (Why is no real title available?)
• A robust maximum completion time measure for scheduling
• Approximation algorithms for scheduling unrelated parallel machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Minimizing average flow time on related machines
• Model-driven optimization using adaptive probes
• Scheduling for flow-time with admission control
• Scheduling with Outliers
• Techniques for scheduling with rejection

Cited in

(2)

• Minimizing Average Flow-Time
• Minimizing average flow-time under knapsack constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896150)