In this paper, we consider some special resource-constrained scheduling problems, which occur e.g. in production or in computer science. We consider the minimization of the
makespan as well as total tardiness. Some complexity and approximability results are given as well as relationships to other scheduling problems.
F. Werner, E. Gafarov, On Scheduling Problems with Forbidden Stack-Overflows / Manufacturing Modelling, Management and Control — 9th MIM 2019, Berlin 2019