本文主要考虑平行机半在线排序问题。
This paper studies semi online parallel machine scheduling problems.
研究了已知总加工时间的两台同类机半在线问题。
A semi on-line version on two uniform machines with the given total processing time is studied.
考虑已知工件最大加工时间的两台同类机半在线问题。
The online algorithms of two uniform machines scheduling problem with availability constraint are studied.
应用推荐