[1]熊禾根,李建军,孔建益,等.考虑工序相关性的动态JobShop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55.
[2]Rajendran C,Holthaus O.A comparative study of dispatc-hing rulesin dynamic flowshop andjob shops[J].EuropeanJournal of Operational Research,1999,116(1):156-170.
[3]郑大钟,赵千川.离散事件动态系统[M].北京:清华大学出版社,2001.
[4]Panwalkar S S,Iskander W.A survey of scheduling rules[J].Operations Research,1977,25(1):45-61.
[5]Garey M,Johnson D,Sethi R.The complexity of flowshopand job shop scheduling[J].Mathematics of Operations Re-search,1976,(1):117-129.
[6]Nagarjuna N,Mahesh O,Rajagopal K.A heuristic basedon multi-stage programming approach for machine-loadingproblemin a flexible manufacturing system[J].Robotics andComputer Integrated Manufacturing.2006,(22):342-352.
[7]Hiroshi Ohta,Toshihiro Nakatani.A heuristic job-shopscheduling algorithm to mini mize the total holding cost ofcompleted and in-process products subject to no tardy jobs[J].Int.J.Production Economics,2006,(101):19-29.
[8]Daeyoung Chung,Kichang Lee,Kitae Shin,et al.A newapproach to job shop scheduling problems with due date con-straints considering operation subcontracts[J].Int.J.Pro-duction Economics.2005,(98):238-250.
[9]杨丰,李建军,肖祥芷.基于Web的模具企业生产管理系统研究[J].锻压技术,2003,28(2):64-67.
|