Scheduling to minimize release-time resource consumption and tardiness penalties

The authors consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, the authors discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms.