25434

Автор(ы): 

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Single machine scheduling problems with financial resource constraints: some complexity results and properties

Электронная публикация: 

Да

ISBN/ISSN: 

ISSN 0165-4896

Наименование источника: 

  • Mathematical Social Sciences

Обозначение и номер тома: 

62, No. 1

Город: 

  • Amsterdam

Издательство: 

  • Elsevier

Год издания: 

2011

Страницы: 

http://www.zentralblatt-math.org/zmath/en/search/?q=ai:lazarev.alexander-a
Аннотация
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.

Библиографическая ссылка: 

Гафаров Е.Р., Лазарев А.А., Werner F. Single machine scheduling problems with financial resource constraints: some complexity results and properties // Mathematical Social Sciences. 2011. 62, No. 1. С. http://www.zentralblatt-math.org/zmath/en/search/?q=ai:lazarev.alexander-a.