Minimizing the total weighted completion time in the relocation problem Научная публикация

Журнал	Journal of Scheduling ISSN: 1094-6136
Вых. Данные	Год: 2010, Том: 13, Номер: 2, Страницы: 123-129 Страниц : 7 DOI: 10.1007/s10951-009-0151-7
Ключевые слова	Approximation algorithm; NP-hardness; Relocation problem; Resource-constrained scheduling
Авторы	Kononov Alexander V. 1,2 , Lin Bertrand M.T. 3
Организации	1 Sobolev Institute of Mathematics, Novosibirsk, Russia 2 Novosibirsk State University 3 Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan