Relocation scheduling subject to fixed processing sequences Научная публикация

Журнал	Journal of Scheduling ISSN: 1094-6136
Вых. Данные	Год: 2015, Том: 19, Номер: 2, Страницы: 153-163 Страниц : 11 DOI: 10.1007/s10951-015-0455-8
Ключевые слова	Relocation problem · Resource-constrained scheduling · Parallel dedicated machines · Fixed sequence · Dynamic programming · NP-hardness
Авторы	Lin Bertrand M.T. 1 , Hwang F.J. 3 , Kononov Alexander V. 2
Организации	1 Department of Information Management and Finance, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan 2 3 Sobolev Institute of Mathematics, Novosibirsk, Russia 3 School of Mathematical and Physical Sciences, University of Technology Sydney, Ultimo, Australia