Single machine scheduling problems with financial resource constraints: some complexity results and propertiesстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 18 июля 2013 г.
Аннотация:We consider single machine scheduling problems with a non-renewable resource. These types of
problems have not been intensively investigated in the literature so far. For several problems of these
types with standard objective functions (namely the minimization of makespan, total tardiness, number of
tardy jobs, total completion time and maximum lateness), we present some complexity results. Particular
attention is given to the problem of minimizing total tardiness. In addition, for the so-called budget
scheduling problem with minimizing the makespan, we present some properties of feasible schedules.