Publisher
Springer International Publishing
Reference26 articles.
1. Auad, R., Erera, A., Savelsbergh, M.: Using simple integer programs to assess capacity requirements and demand management strategies in meal delivery. Preprint, Optimization Online (2020)
2. Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Sched. 2(6), 245–252 (1999)
3. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331–352 (2001)
4. Berman, P., DasGupta, B.: Improvements in throughout maximization for real-time scheduling. In: STOC, pp. 680–687. ACM (2000)
5. Chrobak, M., Dürr, C., Jawor, W., Kowalik, L., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput. J. Sched. 9(1), 71–73 (2006)