Minimizing the total weighted completion time in the relocation problem Full article

Journal	Journal of Scheduling ISSN: 1094-6136
Output data	Year: 2010, Volume: 13, Number: 2, Pages: 123-129 Pages count : 7 DOI: 10.1007/s10951-009-0151-7
Tags	Approximation algorithm; NP-hardness; Relocation problem; Resource-constrained scheduling
Authors	Kononov Alexander V. 1,2 , Lin Bertrand M.T. 3
Affiliations	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