摘要
本文讨论了一类新的加工时间可控的单机排序问题。我们所考虑的目标函数由所有工件的加权完工时间之和与对所有工件的实际加工时间偏离额定加工时间的最大不满意程度这两部分组成.对此问题,我们提出了一个多项式算法.
In this paper, we discussed a new kind of single machine scheduling problems with controllable processing times. The objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs' processing times that deviated from their specified ones. We presented a polynomial algorithm to solve the problem.
出处
《运筹学学报》
CSCD
北大核心
2001年第4期27-34,共8页
Operations Research Transactions
基金
This project was supported by the National Natural Science Foundation of China (No.19971057).
