检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Liang Mei Liu Yue Shilun Ge
机构地区:[1]School of Humanities and Social Sciences,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu,212000,China [2]Illinois Institute of Technology,College of Computer Science,Chicago,60616,USA [3]School of Economics and Management,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu,212000,China
出 处:《Data Science and Management》2023年第3期134-143,共10页数据科学与管理(英文)
基 金:supported by the National Natural Science Foundation of China(Grant No.:71972090).
摘 要:Formation and scheduling are the most important decisions in the virtual modular manufacturing system;however,the global performance optimization of the system may be sacrificed via the superposition of two independent decision-making results.The joint decision of formation and scheduling is very important for system design.Complex and discrete manufacturing enterprises such as shipbuilding and aerospace often comprise multiple tasks,processes,and parallel machines,resulting in complex routes.The queuing time of parts in front of machines may account for 90%of the production cycle time.This study established a weighted allocation model of a formation-scheduling joint decision problem considering queuing time in system.To solve this nondeterministic polynomial(NP)problem,an adaptive differential evolution-simulated annealing(ADE-SA)algorithm is proposed.Compared with the standard differential evolution(DE)algorithm,the adaptive mutation factor overcomes the disadvantage that the scale of DE’s differential vector is difficult to control.The selection strategy of the SA algorithm compensates for the deficiency that DE’s greedy strategy may fall into a local optimal solution.The comparison results of four algorithms of a series of random examples demonstrate that the overall performance of ADE-SA is superior to the genetic algorithm,and average iteration,maximum completion time,and move time are 24%,11%,and 7%lower than the average of other three algorithms,respectively.The method can generate the joint decision-making scheme with better overall performance,and effectively identify production bottlenecks through quantitative analysis of queuing time.
关 键 词:Joint decision-making Queue time Virtual module Hybrid algorithm
分 类 号:TN9[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229