• 中国科技核心期刊
  • RCCSE中国核心学术期刊
  • 中国高校优秀科技期刊
  • 广东省优秀科技期刊

带时间窗口的自动化混流生产线调度方法

雷卫东, 车阿大

雷卫东, 车阿大. 带时间窗口的自动化混流生产线调度方法[J]. 工业工程, 2011, 14(5): 110-115.
引用本文: 雷卫东, 车阿大. 带时间窗口的自动化混流生产线调度方法[J]. 工业工程, 2011, 14(5): 110-115.
Lei Weidong, Che Ada. Scheduling Algorithm for Automated Mixed Production Line with Time Window Constraint[J]. Industrial Engineering Journal, 2011, 14(5): 110-115.
Citation: Lei Weidong, Che Ada. Scheduling Algorithm for Automated Mixed Production Line with Time Window Constraint[J]. Industrial Engineering Journal, 2011, 14(5): 110-115.

带时间窗口的自动化混流生产线调度方法

基金项目: 国家自然科学基金资助项目(50605052、71071129);教育部“新世纪优秀人才支持计划”(NCET-06-0875)
详细信息
    作者简介:

    雷卫东(1985-),男,陕西省人,博士研究生,主要研究方向为工业工程.

Scheduling Algorithm for Automated Mixed Production Line with Time Window Constraint

  • 摘要: 研究了一类带时间窗口的自动化混流生产线调度问题,其中包括工件排序和机器人搬运作业排序两类问题。在对问题进行系统分析的基础上,考虑处理时间窗口约束、机器人搬运能力约束和工作站能力约束,使用混合整数规划方法建立了此类问题的通用数学模型,并采用CPLEX软件求解模型,以印刷电路板电镀生产线为实例并通过随机算例验证该方法的有效性。
    Abstract: The scheduling problem for a class of automated mixed production line with time window constraint is discussed. For such a system, it should sequence both the jobs and the robot movements. Based on a systematic analysis, in considering time window constraint on job processing times, robot availability constraint, and resource capability constraint, the problem is formulated as a mixed integer programming model. Then, the commercial software CPLEX is used to solve it. Computational results on benchmark and randomly generated instances show that the proposed MIP approach is very efficient in scheduling the automated mixed production line.
  • [1] Dawande M,Geismar H N,Sethi S P,et al. Sequencing and scheduling in robotic cells: recent development [J]. Journal of Scheduling,2005,8(5):387-426.
    [2] Che A,Chu C. Multidegree cyclic scheduling of a no wait robotic cell with multiple robots [J]. European Journal of Operation Research,2009,199(1): 77-88.
    [3] Leung J,Zhang G. Optimal cyclic scheduling for printed circuitboard production lines with multiple hoists and general processing sequences[J]. IEEE Transactions on Robotics and Automation 2003,19(3): 480-484.
    [4] Lei L,Wang T J. A proof: the cyclic hoist scheduling problem is NP-hard [R]. New Jersey,USA: Rutgers University,1989.
    [5] Chen H,Chu C,Proth J M. Cyclic scheduling of a hoist with time window constraints [J]. IEEE Transactions on Robotics and Automation,1998,14(1): 144-152.
    [6] Yan P,Chu C,Yang N,et al. A branch and bound algorithm for Optimal Cyclic Scheduling in a Robotic Cell with Processing Time windows [J]. International Journal of Production Research,2010,48(21): 6461-6480.
    [7] 李鹏,车阿大. 基于混沌遗传算法的自动化生产单元调度方法研究[J].系统工程,2008,26(11):75-80.
    [8] Liu J,Jiang Y,Zhou Z. Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution [J]. IIE Transactions,2002,34(10): 905-914.
    [9] Che A,Chu C. Cyclic hoist scheduling in large reallife electroplating lines [J]. OR Spectrum,2007,29(3): 445-470.
    [10] Lei L,Liu Q. Optimal cyclic scheduling of a robotic processing line with twoproduct and timewindow constraints [J]. INFOR,2001,39(2): 185-199.
    [11] Amraoui A E,Manier A M,Moudni A E,et al. A mixed linear problem for a multipart cyclic hoist scheduling problem [J]. International Journal Science and Techniques of Automatic & Computer Engineering,2008,2(special issue): 612-623.
计量
  • 文章访问数:  3724
  • HTML全文浏览量:  8
  • PDF下载量:  0
  • 被引次数: 0
出版历程
  • 刊出日期:  2011-10-30

目录

    /

    返回文章
    返回