工业工程
工業工程
공업공정
Industrial Engineering Journal
2015年
3期
98~104
,共null页
作业车间 JIT调度 提前/拖期 遗传算法 三阶段解码机制
作業車間 JIT調度 提前/拖期 遺傳算法 三階段解碼機製
작업차간 JIT조도 제전/타기 유전산법 삼계단해마궤제
job-shop ; jit scheduling; earliness/tardiness ; genetic algorithm ; three-stage decoding
零部件加工过程的精细化管控是保证大型复杂装备制造企业高效、均衡和低成本运营的重要手段。针对现有JIT调度方法普遍采用两阶段求解策略导致调度算法计算效率较低的问题,本文提出一种单阶段的改进型遗传算法解决思路:针对每一迭代优化过程中的染色体,设计了一种包含半主动解码、拖期工件贪婪插入、提前工件贪婪插入的三阶段渐进式解码机制,以引导待调度工序集尽可能在各自的交货时间点准时完工。这种三阶段解码方法具有与非正规调度指标吻合、解码机制简单和解码速度快等独特优势,最后采用72个JIT调度标准算例验证了该方法在优化性能、计算效率等方面的有效性。
零部件加工過程的精細化管控是保證大型複雜裝備製造企業高效、均衡和低成本運營的重要手段。針對現有JIT調度方法普遍採用兩階段求解策略導緻調度算法計算效率較低的問題,本文提齣一種單階段的改進型遺傳算法解決思路:針對每一迭代優化過程中的染色體,設計瞭一種包含半主動解碼、拖期工件貪婪插入、提前工件貪婪插入的三階段漸進式解碼機製,以引導待調度工序集儘可能在各自的交貨時間點準時完工。這種三階段解碼方法具有與非正規調度指標吻閤、解碼機製簡單和解碼速度快等獨特優勢,最後採用72箇JIT調度標準算例驗證瞭該方法在優化性能、計算效率等方麵的有效性。
령부건가공과정적정세화관공시보증대형복잡장비제조기업고효、균형화저성본운영적중요수단。침대현유JIT조도방법보편채용량계단구해책략도치조도산법계산효솔교저적문제,본문제출일충단계단적개진형유전산법해결사로:침대매일질대우화과정중적염색체,설계료일충포함반주동해마、타기공건탐람삽입、제전공건탐람삽입적삼계단점진식해마궤제,이인도대조도공서집진가능재각자적교화시간점준시완공。저충삼계단해마방법구유여비정규조도지표문합、해마궤제간단화해마속도쾌등독특우세,최후채용72개JIT조도표준산례험증료해방법재우화성능、계산효솔등방면적유효성。
Some parts of large and complex products are very complicated in manufacturing since they have many operations to go through and are time-consuming. The just-in-time (JIT) scheduling is suitable to lean control these manufacturing process. In order to cope with the time consuming problem, the two-stage strategies were employed to solve JIT scheduling problem in most researches. A novel genetic algorithm (GA) with three-stage decoding mechanism is introduced in this research. In each iteration process of GA, the chromosomes, which are represented by an operation-based scheme, are decoded successively by three stages. Firstly, the semi-active decoding method is induced to explore the more search space of solu- tions. Secondly, the greedy insertion for tardy operations is executed to swap the tardy operations left to the machine idle time to reduce the tardiness costs of solution. Thirdly, the greedy insertion for early opera- tions is proposed to swap the early operations rightly to the suitable machine idle time to cut the more earli- ness costs. The experimental results finally demonstrate the effectiveness and efficiency of our algorithm o- ver a wide range of benchmarks.