运筹与管理 ›› 2018, Vol. 27 ›› Issue (3): 1-8.DOI: 10.12005/orms.2018.0053

• 理论分析与方法探讨 •    下一篇

基于Epsilon约束法的短纤维生产调度的双目标优化研究

郑斐峰1, 何俊凯1, 刘明2   

  1. 1.东华大学 旭日工商管理学院,上海 200051;
    2.同济大学 经济与管理学院,上海 200092
  • 收稿日期:2016-11-16 出版日期:2018-03-25
  • 作者简介:郑斐峰(1976-),男,福建三明人,教授,博士,主要研究方向:现代企业生产与服务调度、集装箱港口物流优化;何俊凯(1991-),男,河南洛阳人,博士研究生,主要研究方向:生产调度优化;刘明(1983-),男,辽宁辽阳人,副教授,博士,主要研究方向:生产调度优化。
  • 基金资助:
    国家自然科学基金(71571134) 上海市人才发展资金资助项目(201471);东华大学励志计划(A201305)及中央高校基本科研业务专项资金资助项目

An Exact Epsilon-constraint Algorithm for the Bi-objective Optimization Problem of Scheduling Staple Fiber Production

ZHENG Fei-feng1, HE Jun-kai1, LIU Ming2   

  1. 1.Glorious Sun School of Business & Management, Donghua University, Shanghai 200051, China;
    2.School of Economics & Management, Tongji University, Shanghai 200092, China
  • Received:2016-11-16 Online:2018-03-25

摘要: 针对短纤维生产行业实际,本文综合考虑客户的需求差异、客户的重要程度、纤维生产设备的准备时间以及交货期差异等因素,研究连续需求下的短纤维生产排序优化问题。首先,本文建立双目标整数规划模型,即最小化客户订单总延迟和最小化机器总准备时间;其次,设计Epsilon约束算法并调用CPLEX精确求解调度方案,即帕累托前沿;最后设计非支配排序的遗传算法(NSGA-II)求解大规模生产下的调度优化方案。通过实验,证明该整数规划模型和算法对解决多客户连续需求问题具有实际价值,进而可以为短纤维生产企业提供参考。

关键词: 短纤维生产调度, 双目标整数规划, Epsilon约束算法, NSGA-II算法

Abstract: This paper studies the scheduling problem of staple fiber production with successive orders, which considers the demand and due date differences between clients and the setup time of machine when switching components. Firstly, we establish a bi-objective integer linear programming model so as to minimize the total tardiness of orders and total setup time of machine. Then, we conduct an accurate algorithm to get the precise solutions of proposed model, i.e., Pareto frontier. Finally, we NSGA-II to sovle this model within a devise substantial amount of time. Simulation experiments prove the correctness and effectiveness of this model and proposed algorithms, which can be considered to use as an reference in daily process.

Key words: staple fiber production scheduling, bi-objective integer linear programming, epsilon constraint method, NSGA-II

中图分类号: