考虑多急件到达的作业车间重调度研究  

Research on Job Shop Rescheduling Considering Rush Orders

作　　者：任玺悦 王修贤 耿娜 江志斌 REN Xiyue;WANG Xiuxian;GENG Na;JIANG Zhibin(Department of Industrial Engineering and Management,Shanghai Jiao Tong University,Shanghai 200240,China;Sino-US Global Logistics Institute,Shanghai Jiao Tong University,Shanghai 200030,China;Antai College of Economics and Management,Shanghai Jiao Tong University,Shanghai 200030,China)

机构地区：[1]上海交通大学工业工程与管理系,上海200240 [2]上海交通大学中美物流研究院,上海200030 [3]上海交通大学安泰经管学院,上海200030

出　　处：《工业工程与管理》2022年第3期74-83,共10页Industrial Engineering and Management

基　　金：科技创新2030“新一代人工智能”重大项目(2018AAA0101700)课题五;国家自然科学基金重点项目(71931007)。

摘　　要：为解决大规模急件插单重调度优化问题,以最小化最大完工时间及加权延期成本为目标,构建混合整数规划模型。提出基于新的匹配策略的混合遗传禁忌搜索算法对该问题进行求解,采用基于贪婪规则的启发式算法改进初始解的质量,提出基于自适应的变异算子选择算法,同时引入部分非关键工序交换规则改进N5邻域结构,提高算法的局部搜索能力。实验结果验证了所提算法的有效性和可行性,并表明急件插单时间发生的越早,该算法优越性越突出。In order to solve the rescheduling optimization problem of the large-scale rush orders insertion,the mixed integer programming model was established to minimize the maximum completion time and the weighted tardiness.A hybrid genetic-tabu search algorithm based on matching strategy was proposed.A heuristic algorithm based on greedy rules was adopted to improve the quality of initial solution.The adaptive mutation operator selection algorithm was proposed.Meanwhile,the improved N5 neighborhood structure with non-critical process exchange rules was introduced to improve the local search ability of the algorithm.The results prove the effectiveness and feasibility of proposed algorithm,and show that the earlier rush orders arrive,the better superiority of the proposed algorithm is.

关 键 词：多急件到达 重调度 匹配策略 邻域结构 混合遗传禁忌搜索算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]