.png){kind=icon}
.png){kind=icon}
Return
A linear compound algorithm for uniform machine scheduling
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02684446.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider the classical two uniform machine scheduling problem. We present a compound algorithm which consists of three Greedy-like subprocedures running independently. We prove that the algorithm has a worst-case bound of 7/6 and runs in linear time.
Keywords:
uniform machine scheduling
worst-case analysis
analysis of algorithm