Title of article
A note on “parallel machine scheduling with non-simultaneous machine available time”
Author/Authors
Chung-Yee Lee، نويسنده , , Yong He، نويسنده , , Guochun Tang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
3
From page
133
To page
135
Abstract
The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying the Longest Processing Time (LPT) algorithm to the problem can be tightened if the number of active machines is smaller than the total number of machines.
Keywords
Parallel machine scheduling , Machine availability constraint , Error-bound analysis
Journal title
Discrete Applied Mathematics
Serial Year
2000
Journal title
Discrete Applied Mathematics
Record number
885049
Link To Document