CAJ | 학술논문

考虑机器人在装载站、机床、卸载站三者间搬运时间和空载时间的情况下求解柔性机器人制造单元Job-shop类型调度问题,目标是求所有工件加工完成并搬至卸载站的最短时间. 首先,在分析机器人制造单元调度问题特点的基础上建立其数学模型,提出了一种新的对机器人搬运工序排序组成搬运序列矩阵的调度方法,机器人按搬运序列搬运,机床则按先到先服务规则( FCFS )加工;然后针对这种调度方法提出了一种改进遗传算法,为遗传算法设计了一种基于搬运工序编码方法与启发式分配策略,设计了一种启发式搬运矩阵调整方法,最后,把启发式调整算法与遗传算法结合组成混合算法对调度问题进行求解,通过标准算例计算,验证了算法的有效性.
고필궤기인재장재참、궤상、사재참삼자간반운시간화공재시간적정황하구해유성궤기인제조단원Job-shop류형조도문제,목표시구소유공건가공완성병반지사재참적최단시간. 수선,재분석궤기인제조단원조도문제특점적기출상건립기수학모형,제출료일충신적대궤기인반운공서배서조성반운서렬구진적조도방법,궤기인안반운서렬반운,궤상칙안선도선복무규칙( FCFS )가공;연후침대저충조도방법제출료일충개진유전산법,위유전산법설계료일충기우반운공서편마방법여계발식분배책략,설계료일충계발식반운구진조정방법,최후,파계발식조정산법여유전산법결합조성혼합산법대조도문제진행구해,통과표준산례계산,험증료산법적유효성.
Considering the transport time of robot among loading station machine and unloading station to solve flexible robotic manufacturing cell scheduling problem . The goal is to find the shortest time for all workpiece is completed and moved to unload station. Firstly, mathematical model is established based on a-nalysis of the characteristics of flexible robot manufacturing cell scheduling problems. A new scheduling method based on sequence matrix of robot transport operation is proposed, machine processing is based on first come first serve rule ( FCFS); Then, an improved genetic algorithm is proposed for this scheduling method ,handling procedure code method and heuristic assignment strategy for genetic algorithm is designed, heuristic handling sequence adjustment algorithm is proposed;Finally, heuristic algorithm is combined with genetic algorithm to build hybrid algorithm to solve this scheduling problem, through the standard example calculation, verified the effectiveness of the algorithm.