摘要
给出了求解交货期固定的工件准时完工数最大的排序问题的多项式时间算法。
In this paper, we discuss the scheduling problem of maximal number of jobs which must be completed at its due date Just In Time. We research two cases, single machine and parallel machine. We give two polynomial time algorithm to solve these two cases respectively.
出处
《系统工程理论方法应用》
2000年第3期224-228,共5页
Systems Engineering Theory·Methodology·Applications
基金
国家自然科学基金项目!(197710 5 7)
