公开(公告)号：KR1020120138549A

公开(公告)日：2012-12-26

申请号：KR1020110058112

申请日：2011-06-15

Applicant: 전북대학교산학협력단

Inventor： 김동원 ,  이종영 ,  조기현

IPC: G06Q10/06 ,  G06Q10/10 ,  G06Q50/04

CPC classification number: Y02P90/30 ,  G06Q10/06311 ,  G06Q10/06316 ,  G06Q10/1097 ,  G06Q50/04

Abstract: PURPOSE: Algorithm for establishing a production schedule plan of an order production type factory and a production schedule plan establishment system are provided to maximize production efficiency by applying shifting bottleneck algorithm, genetic algorithm, and a minimum slack rule. CONSTITUTION: A system for production of an order product disassembles the whole process as various part processes through shifting bottleneck algorithm. The system progresses the disassembled part processes by applying a heterogeneous parallel machine for different work, a homogeneous parallel machine for the same work, and a single machine. Genetic algorithm is applied to the heterogeneous parallel machine or the homogeneous parallel machine. A minimum slack rule is applied to the single machine. Work of the part processes is restructured through the shifting bottleneck algorithm for maximizing a processing time except for working hours. [Reference numerals] (AA) Start; (BB) Sum of an initial processing time; (CC) Composition with a part problem; (DD) Order combination value of the whole machines is reflected?; (EE) Machine, which previously moves as bottleneck movement, is excepted; (FF) End; (GG) Heterogeneous parallel machine; (H1) Determining 16 chromosome sizes; (H2,J2) Determining an initial population; (H3,J3) Satisfying evaluation reference of adaptation of each object?; (H4,J4) Selection(culling or proliferation) execution; (H5,J5) Hybridization execution; (H6,J6) Mutation execution; (II) Homogeneous parallel machine; (J1) Determining 31 chromosome sizes; (KK) Single machine; (L1) Arrangement from work which a margin time is short; (L2,L3,L4) Selecting a minimum Lmax value with order combination; (L5) Selecting a machine which a Lmax value is the biggest; (L6) Reflecting selected order; (MM) Maximizing a work time after leaving work; (N1) Reflection to the total processing time; (N2) Changing process order; (N3) Dividing work into a 12 time unit; (N5) Comparing the processing time of last work and a next processing time; (OO) Big; (PP) Small; (QQ) Algorithm flow chart

Abstract translation: 目的：提供订单生产型工厂生产计划计划和生产计划制定系统的算法，通过应用转移瓶颈算法，遗传算法和最小松弛规则来最大限度地提高生产效率。 规定：生产订单产品的系统通过转移瓶颈算法将整个流程分解为各个零件流程。 系统通过对不同工作应用异构并联机器，对同一工作采用均质平行机器和单台机器来进行拆卸的零件加工。 遗传算法应用于异构并行机或均匀并联机。 最小松弛规则适用于单机。 通过改变瓶颈算法对部件过程的工作进行重组，以最大化除工作时间之外的处理时间。 （附图标记）（AA）开始; （BB）初始处理时间的总和; （CC）具有部分问题的组成; （DD）整机的订单组合值是否反映？ （EE）机器，以前作为瓶颈运动，是除外; （FF）结束; （GG）异构并联机; （H1）确定16条染色体大小; （H2，J2）确定初始种群; （H3，J3）满足每个对象的适应性评估参考？ （H4，J4）选择（剔除或扩散）执行; （H5，J5）杂交执行; （H6，J6）突变执行; （二）均质平行机; （J1）确定31条染色体大小; （KK）单机; （L1）边际时间短的工作安排; （L2，L3，L4）用顺序组合选择最小Lmax值; （L5）选择Lmax值最大的机器; （L6）反映所选订单; （MM）离职后最大限度地延长工作时间; （N1）反映总处理时间; （N2）改变流程顺序; （N3）将工作划分为12个时间单位; （N5）比较上次工作的处理时间和下一个处理时间; （OO）大; （PP）小; （QQ）算法流程图