We 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, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo‐polynomial time algorithms.
|Number of pages||18|
|Journal||Naval Research Logistics (NRL)|
|Publication status||Published - 1 Jan 1995|
ASJC Scopus subject areas
- Modelling and Simulation
- Ocean Engineering
- Management Science and Operations Research