基于交货期的流水线车间调度算法设计与实现  

The design and application of algorithm for flow-shop scheduling module base on consignment time

作　　者：蔡兰[1] 郭顺生[1] 王彬[1] 

机构地区：[1]武汉理工大学机电学院,武汉430070

出　　处：《机械设计与制造》2005年第8期161-163,共3页Machinery Design & Manufacture

基　　金：国家重点攻关资助项目(2003BA103C)

摘　　要：这里提出了在流水线调度时可以利用遗传算法计算出工件的最短通过时间,但同时应考虑交货期的影响、设备的负荷率和员工加班等问题。在设计过程中,根据实际,改进常规遗传算法,设计出一种基于交货期的遗传算法,可以很快的收索到最优个体。实例证明了其可行性。This paper introduces a method to design Job - shop scheduling module by using genetic algorithm, gains the leust process time of workpieces . In the same time, the infection of consignment time, the burthen of equipment and overtime should be considered. In the course of design, according to reality, this paper improves the ordinary genetic algorithm and designs a optimization scheduling algorithm base on the consignment time. It＇ s easy to find out optimum individual quickly. It also gives an example that proved it was feasible and effective approach method.

关 键 词：流水调度 遗传算法 交货 

分 类 号：TB497[一般工业技术]