AN ALGORITHM FOR PLANNING OF THE PRODUCTION SCHEDULE AT THE JOB-SHOP COMPANY AND THE PLANNING SYSTEM OF THE PRODUCTION SCHEDULE CITED THE ALGORITHM

摘要

PURPOSE: algorithm establishes the Make to order plan type factory of production plan and the plan supplement system of production scheduling plan allowance of ammunition is supplied to maximization production efficiency, by applying Bottleneck Procedure for Job algorithm, genetic algorithm, and minimum Business is stagnant rule. ;CONSTITUTION: system passes through Bottleneck Procedure for Job algorithm for generating the order products decomposition mutual expressions of affection as various part processes. The part process that the Xi System are dismantled applies the different operating of non-uniform parallel machine, in the identical work of identical parallel machines and a machine. Genetic algorithm is applied to isomerism parallel machine or uniform parallel machine. It is minimum that Business is stagnant that rule is applied to single machine. The work of part process reconstruct is by Bottleneck Procedure for Job algorithm for maximizing the processing time in addition to working hour. ;The 2013 of copyright KIPO submissions;[Reference numerals] (AA) starts; The sum of (BB) the preparatory processing preparatory processing time; (CC) composition and subproblem; Does is the value of command in combination (DD) reflection complete machine? (EE) machine, and previously movement is moved as bottleneck, except; (FF) terminate; (GG) heterogeneous parallel machine; Chromosome size (H1) determines 16; (H2, J2) determines initial population; Does (H3 meets reference adaptive J3) assess each object? (H4, J4) selects or selects (proliferation) to execute; (H5, J5) hybridization executes; (H6, J6) mutation executes; (II) uniform parallel machine; Chromosome size (J1) determines 31; (KK) single machine device; Arrange that a margin time is shorter from work (L1); (L2, L3, L4) selects minimum LMAX value processs in order combination; Machine (L5) selects a LMAX value maximum; (L6) selected order is reflected; (MM) work is left after the maximization working time; (N1) it reflects and total processing time; (N2) change process order; (N3) cutting workpiece is divided into 12 chronomeres; (N5) compare processing time last work and next processing time; (OO) big; (PP) small; (QQ) algorithm flow chart