Title of article
The effect of machine availability on the worst-case performance of LPT Original Research Article
Author/Authors
Hark-Chin Hwang، نويسنده , , Kangbok Lee، نويسنده , , Soo Y. Chang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
13
From page
49
To page
61
Abstract
We consider the makespan minimization parallel machine scheduling problem where each machine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing time first algorithm (LPT) is affected by the availability of machines. In particular, for given m machines, we analyze the cas
Keywords
Parallel machines scheduling , Shutdowns , Availability , Longest processing time (LPT)
Journal title
Discrete Applied Mathematics
Serial Year
2005
Journal title
Discrete Applied Mathematics
Record number
886088
Link To Document