In this papers we consider a problem of scheduling two or more independent project against a single resource, whose availability may vary over time, so as to minimize the total penalty for project tardiness. A simple heuristic is proposed and a bound on its worst case performance is determined.
