【摘要】 优化目标为总流程时间的单机成组作业优化调度问题 ,明显是NP -hard的。该文在利用优化性质的基础上 ,提出了一种构造性的启发算法。该算法计算量小 ,可应用于大规模优化调度问题。仿真结果表明该算法能够找到次优解 ,其性能优于已有的启发算法更多还原

【Abstract】 The single machine job class scheduling problem of minimizing total fl owtime is obviously NP-hard. This paper addresses a constructive heuristic algor ithm basing on the optimal properties of solution. This algorithm can solve the large scale problem because its computing complexity is small. The simulation re sults show that it can not only obtain near optimal solution but also better tha n the existed heuristic algorithm.更多还原