Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints

In this paper, we describe new complexity results and approximation algorithms for single-machine scheduling problems with non-renewable resource constraints and the total weighted completion time objective. This problem is hardly studied in the literature. Beyond some complexity results, only a ful...

Ausführliche Beschreibung