2.624

2020影响因子

(CJCR)

  • 中文核心
  • EI
  • 中国科技核心
  • Scopus
  • CSCD
  • 英国科学文摘

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

就绪时间受限的负荷单机环境下返工工件重调度方法

郭艳东 王庆 黄敏

郭艳东, 王庆, 黄敏. 就绪时间受限的负荷单机环境下返工工件重调度方法. 自动化学报, 2013, 39(12): 2100-2110. doi: 10.3724/SP.J.1004.2013.02100
引用本文: 郭艳东, 王庆, 黄敏. 就绪时间受限的负荷单机环境下返工工件重调度方法. 自动化学报, 2013, 39(12): 2100-2110. doi: 10.3724/SP.J.1004.2013.02100
GUO Yan-Dong, WANG Qing, HUANG Min. Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads. ACTA AUTOMATICA SINICA, 2013, 39(12): 2100-2110. doi: 10.3724/SP.J.1004.2013.02100
Citation: GUO Yan-Dong, WANG Qing, HUANG Min. Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads. ACTA AUTOMATICA SINICA, 2013, 39(12): 2100-2110. doi: 10.3724/SP.J.1004.2013.02100

就绪时间受限的负荷单机环境下返工工件重调度方法

doi: 10.3724/SP.J.1004.2013.02100
基金项目: 

国家杰出青年科学基金资助项目(71325002,61225012),国家自然科学基金资助项目(71071028,70931001,71021061,71171040),高等学校博士学科点专项科研基金优先发展领域资助课题(20120042130003),高等学校博士学科点专项科研基金资助课题(20110042110024),中央高校基本科研业务费专项资金(N110204003,N120104001)资助

详细信息
    作者简介:

    郭艳东 东北大学信息科学与工程学院系统工程研究所博士研究生,渤海大学副教授. 主要研究方向为生产计划调度,优化与决策.E-mail:gyd1030@163.com

Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads

Funds: 

Supported by the National Science Foundation for Distinguished Young Scholars of China (71325002, 61225012), National Natural Science Foundation of China (71071028, 70931001, 71021061, 71171040), the Specialized Research Fund of the Doctoral Program of Higher Education for the Priority Development Areas (20120042130003), Specialized Research Fund for the Doctoral Program of Higher Education (20110042110024), the Fundamental Research Funds for the Central Universities (N110204003, N120104001)

  • 摘要: 研究了返工工件的单机重调度问题.在初始调度中初始工件带有不同的就绪时间,优化目标为最小化初始工件等待时间和;重调度时在满足每个初始工件最大等待时间约束情况下安排返工工件的生产,优化目标为最小化所有工件等待时间和.文中首先建立了RRSM (Rescheduling for reworks on single machine)问题模型,并证明其为NP难问题.然后,提出并证明了三个RRSM问题性质,进而根据诸性质设计了求解RRSM问题的动态插入启发式(Dynamic insert heuristic,DIH)算法.证明了应用DIH算法能在多项式时间内求得两种特殊RRSM问题的最优解. 最后,分析了DIH算法解的特点,给出了最优解的判定方法,并通过算例说明了DIH算法的有效性.
  • [1] Liu Min. A survey of data-based production scheduling methods. Acta Automatica Sinica, 2009, 35(6): 785-806 (刘民. 基于数据的生产过程调度方法研究综述. 自动化学报, 2009, 35(6): 785-806)
    [2] Daniels R L, Kouvelis P. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, 1995, 41(2): 363-376
    [3] Gupta S K, Kyparisis J. Single machine scheduling research. Omega, 1987, 15(3): 207-227
    [4] Webster S, Baker K R. Scheduling groups of jobs on a single machine. Operations Research, 1995, 43(4): 692-703
    [5] Yan Yang, Wang Da-Zhi, Wang Ding-Wei, Ip W H, Wang Hong-Feng. Single machine group scheduling problems with the effects of deterioration and learning. Acta Automatica Sinica, 2009, 35(10): 1290-1295
    [6] Zhao Yu-Fang, Tang Li-Xin. Scheduling with agreeable release times and due dates on a single continuous batch processing machine. Acta Automatica Sinica, 2008, 34(8): 957-963 (赵玉芳, 唐立新. 释放时间和工期同序的单机连续型批调度问题. 自动化学报, 2008, 34(8): 957-963)
    [7] Herrmann J W. Rescheduling strategies, policies, and methods. Handbook of Production Scheduling, 2006, 89: 135-148
    [8] Inderfurth K, Kovalyov M Y, Ng C T, Werner F. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. International Journal of Production Economics, 2007, 105(2): 345-356
    [9] Sarker B R, Jamal A M M, Mondal S. Optimal batch sizing in a multi-stage production system with rework consideration. European Journal of Operational Research, 2008, 184(3): 915-929
    [10] Haji R, Haji B. Optimal batch production for a single machine system with accumulated defectives and random rate of rework. Journal of Industrial and Systems Engineering, 2012, 3(4): 243-256
    [11] Wu S D, Storer R H, Chang P C. A rescheduling procedure for manufacturing systems under random disruptions. In: New Directions for Operations Research in Manufacturing. Berlin, Germany: Springer, 1992. 292-308
    [12] Unal A T, Uzsoy R, Kiran A S. Rescheduling on a single machine with part-type depend setup times and deadlines. Annals of Operations Research, 1997, 70: 93-113
    [13] Hall N G, Potts C N. Rescheduling for new orders. Operations Research, 2004, 52(3): 440-453
    [14] Hall N G, Liu Z X, Potts C N. Rescheduling for multiple new orders. INFORMS Journal on Computing, 2007, 19(4): 633-645
    [15] Yuan J J, Mu Y D. Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. European Journal of Operational Research, 2007, 182(2): 936-944
    [16] Yang B B. Single machine rescheduling with new jobs arrivals and processing time compression. The International Journal of Advanced Manufacturing Technology, 2007, 34(3): 378-384
    [17] Zhao C L, Tang H Y. Rescheduling problems with deteriorating jobs under disruptions. Applied Mathematical Modelling, 2010, 34(1): 238-243
    [18] Hoogeveen H, Lenté C, T'kindt V. Rescheduling for new orders on a single machine with setup times. European Journal of Operational Research, 2012, 223(1): 40-46
    [19] Chu C B. A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics, 1992, 39(6): 859-875
    [20] Graham R L, Lawler E L, Lenstra J K, Rinnooy Kan A H G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 1979, 5: 287-326
    [21] Kellerer H, Tautenhahn T, Woeginger G J. Approximability and nonapproximability results for minimizing total flow time on a single machine. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 1996. 418-426
    [22] Chu C. Efficient heuristics to minimize total flow time with release dates. Operations Research letters, 1992, 12(5): 321-330
  • 加载中
计量
  • 文章访问数:  1328
  • HTML全文浏览量:  79
  • PDF下载量:  942
  • 被引次数: 0
出版历程
  • 收稿日期:  2013-03-08
  • 修回日期:  2013-06-14
  • 刊出日期:  2013-12-20

目录

    /

    返回文章
    返回