摘要
本文利用HLP(Hardy-Littlewood-Polya)不等式,讨论了同类工件FoleShop E/T(Earliness/Tardiness)调度问题,目的是确定工件的最优交货期和最优排序.结果表明:问题求解的时间复杂度为O(nlogn).
By using HLP (hardy-Littlewood-Polya) inequality, we discussed a flow shop E/T (Earliness/Tardiness) scheduling with identical jobs to determine the optimal sequences and optimal common due date. It is shown that the problem is solved in O (nlogn) time.
出处
《系统工程》
CSCD
1999年第2期43-45,共3页
Systems Engineering
基金
国家自然科学基金(69674013)
国家攀登计划基金(项目号
970211017)
工业控制技术国家重点实验室开发课题基金资助
