1. Bérczi, K., Király, T., Omlor, S.: Scheduling with non-renewable resources: minimizing the sum of completion times (2019). https://arxiv.org/abs/1911.12138. Preprint
2. Carlier, J.: Problèmes d’ordonnancement à contraintes de ressources: algorithmes et complexité. Université Paris VI-Pierre et Marie Curie, Institut de programmation (1984)
3. Gafarov, E.R., Lazarev, A.A., Werner, F.: Single machine scheduling problems with financial resource constraints: some complexity results and properties. Math. Soc. Sci. 62(1), 7–13 (2011)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness (1979)
5. Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, vol. 5, pp. 287–326. Elsevier (1979)