Minimizing Average Flow-Time under Knapsack Constraint

DOI10.1007/978-3-319-08783-2_50zbMath1333.68076OpenAlexW269969770MaRDI QIDQ2920494

Syamantak Das, Suman K. Bera, Amit Kumar

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_50

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)

This page was built for publication: Minimizing Average Flow-Time under Knapsack Constraint