Publisher
Springer International Publishing
Reference9 articles.
1. Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. In: RTSS, pp. 228–236. IEEE Computer Society (1994). https://doi.org/10.1109/REAL.1994.342713
2. Böhm, M., et al.: Fully dynamic algorithms for knapsack problems with polylogarithmic update time. CoRR, abs/2007.08415 (2020). https://arxiv.org/abs/2007.08415
3. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005). https://doi.org/10.1137/S0097539700382820
4. Chen, L., Eberle, F., Megow, N., Schewior, K., Stein, C.: A general framework for handling commitment in online throughput maximization. Math. Prog. 183, 215–247 (2020). https://doi.org/10.1007/s10107-020-01469-2
5. Eberle, F.: Scheduling and packing under uncertainty. Ph.D. thesis, University of Bremen (2020). https://doi.org/10.26092/elib/436