具有相同加工时间单机调度最优交货期和最优排序的确定

摘要

In this paper, an algorithm in O(n２） 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.%研究了工件加工时间相同的确定单机调度最优交货期和最优加工顺序的问题，且目标函数基于交货期和工件交货时间不准的情况.利用HLP不等式提出了时间复杂度为O(n２)的最优算法.