面向订单的瓶颈资源识别与单机成组作业调度

具有分类设置与提交时间的单机成组作业调度问题明显是NP-Hard问题。一些问题的多项式求解方法不能保证求取最优解。一些启发式算法无法保证瓶颈资源多目标最优。基于改进禁忌搜索算法,建立了此类单机成组作业调度模型,可搜索到该问题的最优解。仿真结果表明,该算法性能优于WSPT启发式算法,能够解决面向订单的多品种小批量生产企业中的瓶颈识别与多目标排产问题。

The Order-oriented Bottleneck Resource Identification and a Single Machine Scheduling with Job Class Setups Based on an Improved Tabu Algorithm

A single machine scheduling with job class setups and realease time is obviously NP-hard problem. Some other problems well- known polynomially solution approches did not guarantee optimality any longer. Some heuristics algorithms could not find the best solution of multi-goals problem The model of single machine scheduling with job class setups and realease time was constructed based on an improved tabu algorithm, We found the best solution of this problem. The simulation results show that it not only can obtain the best optimal solution but also is better than WSPT heuristic algorithm. The algorithm can be used to identify the bottleneck resource and to search the better production seheduling of bottleneck resource for the comnanies which use the order-oriented, multi-varieties and small hatch nroduction model.