.png){kind=icon}
.png){kind=icon}
Return
Parallel-machine scheduling with an availability constraint
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.05.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider two parallel machines scheduling problem where one machine is not available in a specified time period. The unavailable time period is fixed and known in advance. The objective is to minimize the total weighted completion time. The problem is known to be NP-hard. We give a fully polynomial-time approximation scheme (FPTAS) for the problem. We then generalize the results to the case with m parallel machines. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Machine availability constraint
Parallel machine
FPTAS
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W