摘要
研究无容量限制的批处理机时间表问题 ,在工件有到达时间和工期约束下 ,证明了当工件的到达时间和工期 ,或到达时间和加工时间一致单调时 ,该问题是多项式时间可解的 ;当加工时间和工期一致单调时 ,该问题是
The problem of scheduling jobs with release times and due dates on a batch processor with unbounded capacity is considered.Polynomial time algorithms are provided for the case with agreeable release times and due dates and the case with agreeable release times and processing times.NP hardness is established for the case with agreeable processing times and due dates.
出处
《华东理工大学学报（自然科学版）》
CAS
CSCD
北大核心
2001年第4期431-433,共3页
Journal of East China University of Science and Technology
基金
国家自然科学基金资助项目 (1973 10 0 1)
