CAJ | 학술논문

提出了一种基于Petri网的启发式算法用于求解第一类U型装配线平衡问题,算法利用Petri网的可达分析和托肯的移动来决定可分配的作业元素,并按照最小化工作站空闲时间原则从前向后和从后向前两个方向同时分派作业元素到工作站。算法编程简单,可用于快速求解大规模问题。通过对大量问题集的测试验证,说明了算法的有效性。
제출료일충기우Petri망적계발식산법용우구해제일류U형장배선평형문제,산법이용Petri망적가체분석화탁긍적이동래결정가분배적작업원소,병안조최소화공작참공한시간원칙종전향후화종후향전량개방향동시분파작업원소도공작참。산법편정간단,가용우쾌속구해대규모문제。통과대대량문제집적측시험증,설명료산법적유효성。
A Petri net-based heuristic is proposed to balance U-shaped assembly line.By analyzing the reachability and token movement of the Petri net model developed,the set of activities that can be assigned to the workstations are identified.Then,these activities are assigned to the workstations to minimize the idle time.The proposed algorithm is tested on large number of examples.It shows that the algorithm is computationally efficient and is applicable to real-world problems