求解大规模生产排程问题的一种快捷算法.pdfVIP

2008 8 # # : 1001- 2265( 2008) 08- 0039- 04 求解大规模生产排程问题的一种快捷算法 王欣 ( 中国矿业大学 计算机科学与技术学院, 江苏 徐州 221008) : 生产排程是一类复杂而困难的系统性问题, 但其对多品种小批量企业的生产 率以及经济 益的 提高有着至关重要的作用文章针对生产排程时 性差的算法瓶颈, 设计了一套基于交货期的快捷排 程算法算法的基本思想是将加工任务先分配到具体的设备上, 然后根据任务的加工时间为每 个设备 提供一个排程方案该算法体系包括绝对最优方案确定任务分配依次排队二次排程和条件汇报 5 个模块, 其中依次排队是该算法的核心该算法具有寻优合理速度快等优点, 但同时也有只适宜以交 货期为目标的缺点 : 生产排程; 算法; 大规模; 快捷; 交货期 : G65 : A A Rapid A lgorithm in ResolvingLarge-scale Production Scheduling WANG X in ( School of Computer Science and echnology, CUM , Xuzhou Jiangsu 221008, China) Abstract: Production scheduling is a sort of complex and difficult problem, but it is extremely significant for the multi-sort and small-batch enterprise to improve the production efficiency and economic benefit. In this article, a uick scheduling algorithm based on delivery data is designed in order to avoid the bottle- neck ofpoor timeliness of the algorithm in production scheduling. The idea of the algorithm is to distribute machining tasks to idiographic e uipments first and then provide all e uipmentwith schedulingmethod ac- cording to the tasks. machining time. The algorithm system includes fivemodules namely absolutely best scheme determination, task allocation, successive ueuing, secondary scheduling and terms report, among which successive ueuing is the key to the algorithm. The algorithm has the advantages ofoptimizing prop- erly, fast and so on, while it also has the disadvantage that it suits the purpose ofdelivery data only. Key words: production scheduling; algorithm; large-scale; rapid; delivery date : ( 0 [ 1-2]