摘要
本文讨论了一类新的加工时间可控的单机排序问题,其目标函数为正则函数与最大不满意程度函数之和,不满意函数刻划了对工件实际加工时间偏离其额定加工时间不满意的程度,本文对这类问题提出了几个多项式算法。
In this paper, we discussed a new type of shingle machine scheduling problems with controllable processing times. The objective functions being considered were the sum of some regular functions plus the maximum dissatisfaction of all jobs'processing times that deviated from their original ones.
