摘要
研究了工件加工时间相同的确定单机调度最优交货期和最优加工顺序的问题 ,且目标函数基于交货期和工件交货时间不准的情况 .利用 HLP不等式提出了时间复杂度为 O(n2 )
In this paper, an algorithm in O(n 2) time is proposed for the problem of scheduling n jobs with identical processing time on a single machine, the objective is to find the optimal common due date and the optimal sequence to minimize an objective measure based on the due date and the job earliness and tardiness.
出处
《南开大学学报（自然科学版）》
CAS
CSCD
北大核心
2001年第1期89-91,共3页
Acta Scientiarum Naturalium Universitatis Nankaiensis
基金
国家攀登计划基金! (970 2 1 1 0 1 7)
国家自然科学基金! (69674 0 1 3)
