Approximability of scheduling problems with resource consuming jobs

Approximation algorithms for inventory constrained scheduling on a single machine

(2015) Ehab Morsy et al.   JOURNAL OF SCHEDULING

Reductions between scheduling problems with non-renewable resources and knapsack problems

(2015) Péter Györgyi et al.   THEORETICAL COMPUTER SCIENCE

Approximation schemes for single machine scheduling with non-renewable resource constraints

(2013) Péter Györgyi et al.   JOURNAL OF SCHEDULING

Approximability results for the resource-constrained project scheduling problem with a single type of resources

(2012) Evgeny R. Gafarov et al.   ANNALS OF OPERATIONS RESEARCH

Exact algorithms for inventory constrained scheduling on a single machine

(2011) Dirk Briskorn et al.   JOURNAL OF SCHEDULING

Single machine scheduling problems with financial resource constraints: Some complexity results and properties

(2011) Evgeny R. Gafarov et al.   MATHEMATICAL SOCIAL SCIENCES

On the Approximability of Single-Machine Scheduling with Precedence Constraints

(2011) Christoph Ambühl et al.   MATHEMATICS OF OPERATIONS RESEARCH

Tight Approximation Algorithms for Maximum Separable Assignment Problems

(2011) Lisa Fleischer et al.   MATHEMATICS OF OPERATIONS RESEARCH

Complexity of single machine scheduling subject to nonnegative inventory constraints

(2010) Dirk Briskorn et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH