*Result*: BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS.

*Our goal is to show tight bounds on the running time of algorithms for scheduling and packing problems. To prove lower bounds, we investigate implications of the exponential time hypothesis on such algorithms. For exact algorithms we consider the dependence of the running time on the number n of items (for packing) or jobs (for scheduling). We prove a lower bound of 2^o(n) x ∥I∥^O(n), where ∥I∥ denotes the encoding length of the instance, for several of these problems, including SUBSETSUM, KNAPSACK, BINPACKING, <P2∥C<subscript>max</subscript>>, and <P2∥∑w<subscript>j</subscript>C<subscript>j</subscript>>. We also develop an algorithmic framework that is able to solve a large number of scheduling and packing problems in time 2^o(n) x ∑I∑^O(n). Finally, we consider approximation schemes. We show that there is no polynomial time approximation scheme for MULTIPLEKNAPSACK (MKS) and 2D-KNAPSACK with running time 2^o(1/ε) x ∑I∑^O(n) and n^o(1/ε) x ∑I∑^O(n), respectively. [ABSTRACT FROM AUTHOR]

Copyright of SIAM Journal on Discrete Mathematics is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)*