Heuristic Method for Job Shop Scheduling Problem with Combination Processing  

作　　者：YI Ping LI Jian-jun XIONG He-gen 

机构地区：[1]State Key Laboratory of Material Processing and Die ＆ Mould Technology, Huazhong University of Science and Technology, Wuhan 430074, China [2]College of Machinery and Automation, Wuhan University of Science and Technology, Wuhan 430081, China

出　　处：《Computer Aided Drafting,Design and Manufacturing》2009年第1期56-63,共8页计算机辅助绘图设计与制造（英文版）

基　　金：Supported by Research Fund for the Doctoral Program of Higher Education of China(20060487072);National Key Technology R&D Program(2006BAF01A43)

摘　　要：A job shop scheduling problem with a combination processing in complex production environment is proposed. Based on the defining of ＂non-elastic combination processing relativity＂ and ＂virtual process＂, the problem can be simplified and transformed to a traditional one. On the basis of the dispatching rules select engine and considered factors of complex production environment, a heuristic method is designed. The algorithm has been applied to a mould enterprise in Shenzhen for half a year. The practice showed that by using the method suggested the number of delayed orders was decreased about 20% and the productivity was increased by 10 to 20%.A job shop scheduling problem with a combination processing in complex production environment is proposed. Based on the defining of ＂non-elastic combination processing relativity＂ and ＂virtual process＂, the problem can be simplified and transformed to a traditional one. On the basis of the dispatching rules select engine and considered factors of complex production environment, a heuristic method is designed. The algorithm has been applied to a mould enterprise in Shenzhen for half a year. The practice showed that by using the method suggested the number of delayed orders was decreased about 20% and the productivity was increased by 10 to 20%.

关 键 词：combination processing relativity dispatching rules select engine heuristic method 

分 类 号：O224[理学—运筹学与控制论] O223[理学—数学]