摘要
在工件体积和运输车辆容量的双重约束条件下,建立了以最大化成套订单数和最小化工件总配送时间的多目标规划模型,使用多目标排序寻找"约束解"的方法结合遗传算法求解此模型。最后通过算例分析,给出多目标规划模型及其综合算法在FLOW SHOP生产作业环境中的应用。计算结果表明,应用此模型和算法能够满足最大化成套订单数的要求,同时节省总的工件配送时间,有潜在的应用价值。
The problem of machine scheduling with job delivery coordination based on the whole-set orders was proposed. Under the dual constrains of job＇s volume and vehicle＇s capacity during transportation, multi-objective mathematical model was established to minimize the total transportation time and to maximize the whole-set orders. Thereafter, genetic algorithm combined with the ＂restrict solution＂ of multi-objective model was presented to solve fore mentioned model. Finally, both the model and algorithm were implemented in a flow shop scheduling situation, and the results have shown the effectiveness of the algorithm, which can satisfy the requirement of whole-set order while saving total jobs delivery time.
出处
《工业工程与管理》
2008年第5期21-28,共8页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(70572032)
关键词
生产与配送
成套订单
多目标排序
遗传算法
production and delivery
whole set orders
multi objective scheduling
Genetic Algorithm
