Title of article
Note on “Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time”
Author/Authors
Suh-Jenq Yang، نويسنده , , Chou-Jung Hsu، نويسنده , , Dar-Li Yang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
3
From page
215
To page
217
Abstract
This note shows that the problem studied by Hsu et al. (2011) [2] can be solved in O(nm+3) time even though the rate-modifying rate is larger than 1, where m is the number of machines and n is the number of jobs.
Keywords
Total completion time , Scheduling , Rate-modifying activity , Unrelated parallel-machine
Journal title
Information Sciences
Serial Year
2014
Journal title
Information Sciences
Record number
1216022
Link To Document