摘要
对柔性车间单目标调度问题进行了分析,以产品为研究对象,以最大完工时间最小为目标,考虑并行机、加工等待时间对其进行了数学描述和建模。提出了工件加工顺序的决策方法,并改进了Dijkstra算法对其进行求解,通过实验验证了该算法的正确性和有效性,通过与其它文献的比较验证了该算法的优越性。
The mono-objective flexible job shop scheduling problem （FJSP） is analysed. By making one production as research object, considering parallel machine, waiting time and processing order when manufacturing, with the goal of minimized make span, mathematical formulations and modeling were proposed. The decision-making method of processing order was proposed. A new algorithm was designed based on Dijkstra algorithm. The experiments prove the correctness and effectiveness of this algorithm, and the experience and comparison with other references prove the advantages of this algorithm.
出处
《机床与液压》
北大核心
2017年第23期105-109,157,共6页
Machine Tool & Hydraulics
