智能制造系统车间生产计划与调度
|
摘要
车间生产计划与调度,是体现企业竞争力的一个重要方面;其研究具有重要的现实意义和一定的理论价值。研究工作主要内容及创新点如下:
⑴为满足实际生产计划与调度优化目标的多样性需求,提出了一种综合优化目标模型,实现了多目标、模糊目标、特殊性要求子目标等综合目标的评价;试验结果表明该模型合理、可行,并在后续的研究内容中得到成功应用。
⑵为了加快迭代速度、避免早熟,提出了个体优化群体多样化的遗传算法;在该算法中,提出了一种新的矩阵编码及其对应的遗传算子操作方法,并给出了一种可保证群体多样性的GA参数控制方法;试算结果显示,该算法性能优良。
⑶为了提高全局寻优的能力及效率,整合了遗传算法的选择、交叉和变异算子,提出了解的覆盖面较大的集成算子遗传算法。该算法采用一种新的矢量编码及对应的算子操作方法;三个多目标FJSP试算结果,均优于国际最新文献和近期IEEE成员文献的结果。
⑷为了获得求解计划与调度集成优化所需的快速算法,提出了一种个体粒子与群体粒子搜索经验的表示、学习和整合方法,并给出了算法的具体实现;多个标准算例试验结果及其分析显示,该算法计算速度较快。
⑸在上述理论的基础上,为某汽车变速箱企业装配车间,建立了车间生产计划与调度集成优化模型;提出了一种分层搜索优化策略和两层内嵌结构的集成算子遗传算法;给出了该车间生产计划与调度集成优化的具体结果;结果分析表明,所给模型及其求解方法正确可行,其优化结果远好于生产实际中的结果。
⑹建立了该企业轴类热后加工工段生产计划与调度集成优化模型;提出了一种直接搜索的优化策略,并给出了求解方法;计算结果与实际情况的比较表明,所给模型及其求解方法是合理有效的。
The shop production planning and scheduling optimization is very important because of its theoretical and practical significance. The subject is studied in this thesis and several innovations are presented.
A new objective estimate model is presented for shop production planning and scheduling.It can deal with the optimization with multi-objective, uncertain objective, and the sub-objective demand of each job. An example of scheduling is given, which proves this method is feasible and reasonable.
In order to accelerate the convergence speed and to avoid the earliness, an individual optimization and colony diversity genetic algorithm(IOCDGA) is presented. In IOCDGA, a new matrix representation and the basic manipulation for the genetic operator are presented, and the colony average distance and the colony entropy are difined, and the crossover probability and the mutation probability are controlled by the colony diversity. Computational results show that the algorithm is applicable and the number of iterations is less.
For the sake of improving the search ability and efficiency, an integrated operator genetic algorithm(IOGA) is presented, where a new vector representation is presented, and genetic operators are adjusted and united. Computational results are better than the international latest research results.
The discrete particle swarm optimization is studied for the need of high efficiency and speediness algorithm in SPPS integration optimization, in which the representation and learn and footing method are presented for the search experince of the individual and colony particle. The implemention of the algorithm is given. Computational results show that the algorithm is better in speed.
A general integrated optimization scheme of shop production planning and scheduling(SPPS) is present for an automobile gearbox enterprise. The integrated optimization model of SPPS for the assembly workshop, and the representation of solution of optimization and the analysis of solution space are present. A policy of hierarchical search and the implemention of embed IOGA with two-hierarchy are given.The enterprise production data are computed, and the results is fairer far than the production practice.
The integrated optimization model of SPPS for the section of Machining of shaft after heat treatment is presented. A policy of direct search and the implemention of IOGA are given. Examples prove these methods are available and efficient.
The study is supported by key project of National Natural Science Foundation.
⑴为满足实际生产计划与调度优化目标的多样性需求,提出了一种综合优化目标模型,实现了多目标、模糊目标、特殊性要求子目标等综合目标的评价;试验结果表明该模型合理、可行,并在后续的研究内容中得到成功应用。
⑵为了加快迭代速度、避免早熟,提出了个体优化群体多样化的遗传算法;在该算法中,提出了一种新的矩阵编码及其对应的遗传算子操作方法,并给出了一种可保证群体多样性的GA参数控制方法;试算结果显示,该算法性能优良。
⑶为了提高全局寻优的能力及效率,整合了遗传算法的选择、交叉和变异算子,提出了解的覆盖面较大的集成算子遗传算法。该算法采用一种新的矢量编码及对应的算子操作方法;三个多目标FJSP试算结果,均优于国际最新文献和近期IEEE成员文献的结果。
⑷为了获得求解计划与调度集成优化所需的快速算法,提出了一种个体粒子与群体粒子搜索经验的表示、学习和整合方法,并给出了算法的具体实现;多个标准算例试验结果及其分析显示,该算法计算速度较快。
⑸在上述理论的基础上,为某汽车变速箱企业装配车间,建立了车间生产计划与调度集成优化模型;提出了一种分层搜索优化策略和两层内嵌结构的集成算子遗传算法;给出了该车间生产计划与调度集成优化的具体结果;结果分析表明,所给模型及其求解方法正确可行,其优化结果远好于生产实际中的结果。
⑹建立了该企业轴类热后加工工段生产计划与调度集成优化模型;提出了一种直接搜索的优化策略,并给出了求解方法;计算结果与实际情况的比较表明,所给模型及其求解方法是合理有效的。
The shop production planning and scheduling optimization is very important because of its theoretical and practical significance. The subject is studied in this thesis and several innovations are presented.
A new objective estimate model is presented for shop production planning and scheduling.It can deal with the optimization with multi-objective, uncertain objective, and the sub-objective demand of each job. An example of scheduling is given, which proves this method is feasible and reasonable.
In order to accelerate the convergence speed and to avoid the earliness, an individual optimization and colony diversity genetic algorithm(IOCDGA) is presented. In IOCDGA, a new matrix representation and the basic manipulation for the genetic operator are presented, and the colony average distance and the colony entropy are difined, and the crossover probability and the mutation probability are controlled by the colony diversity. Computational results show that the algorithm is applicable and the number of iterations is less.
For the sake of improving the search ability and efficiency, an integrated operator genetic algorithm(IOGA) is presented, where a new vector representation is presented, and genetic operators are adjusted and united. Computational results are better than the international latest research results.
The discrete particle swarm optimization is studied for the need of high efficiency and speediness algorithm in SPPS integration optimization, in which the representation and learn and footing method are presented for the search experince of the individual and colony particle. The implemention of the algorithm is given. Computational results show that the algorithm is better in speed.
A general integrated optimization scheme of shop production planning and scheduling(SPPS) is present for an automobile gearbox enterprise. The integrated optimization model of SPPS for the assembly workshop, and the representation of solution of optimization and the analysis of solution space are present. A policy of hierarchical search and the implemention of embed IOGA with two-hierarchy are given.The enterprise production data are computed, and the results is fairer far than the production practice.
The integrated optimization model of SPPS for the section of Machining of shaft after heat treatment is presented. A policy of direct search and the implemention of IOGA are given. Examples prove these methods are available and efficient.
The study is supported by key project of National Natural Science Foundation.
引文
[1]朱剑英.现代制造系统模式、建模方法及关键技术的新发展[J].机械工程学报.2000,36(8):1~5
[2]何霆,刘飞,马玉林.车间生产调度问题研究[J].机械工程学报. 2000,36(5):97~102
[3] Stenphe C Gravesr. A Review of Production Scheduling[J]. Production Scheduling, 1981,29(4):646~675
[4] Pinedo M. Scheduling theory,algorithms and Systems[M].Prentice Hall,Second Edition,2002.
[5] Yamamoto M. and Nof S. Y., Scheduling/rescheduling in the manufacturing operation system environment [J]. International Journal of Production Research, 1985,23(5):705~722.
[6] Imed Kacem, Slim Hammadi and Pierre Borne. Approach by localization and multiobjective evolutionary optimixation for flexible job-shop scheduling problems[J]. IEEE Transaction on Systems,Man, and Cybernetics,Part C: Application and reviews,2002,3(1):1~13.
[7] I Kacem, S Hammadi and P Borne. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic[J]. Mathematics and Computers in simulation, 2002,60(2) :245~276
[8] Qiao Bing, et al. Solving Flexible Job Shop Scheduling Problem by Genetic Algorithms[J]. Transactions of Nanjing University of Aeronautics &Astronautics, 2001,18(1):108~112.
[9]孙志峻,朱剑英.具有柔性加工路径的作业车间智能优化调度[J].机械科学与技术, 2001,20(6): 45~49
[10]孙志峻,乔冰,潘全科等.具有柔性加工路径的作业车间批量调度优化研究[J].机械科学与技术,2002,21(3):348~354
[11]Nabil Nasr, Elsayed E A. Job shop scheduling with alternative machines[J].International Journal of production Research,1990,28(9):1595~1609
[12]Weijun Xia, Zhiming Wu. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems[J]. Computers & Industrial Engineering, 2005,48(3) :409~425.
[13]Brandimarte P. Routing and scheduling in a flexible job shop by taboo search[J]. Annals of Operation Research. 1993, 41(1):157~183
[14]Amit Nagar, Jorge Haddock and Sunderesh Heragu. Multiple and bicriteria scheduling:A literature survey[J]. European Journal of Operational Research, 1995,81(1):88~104
[15]S G Ponnamblam,V.Ramkumar. A multiobjective genetic algorithm for job shop scheduling[J]. Production Planning &Control. 2001,12(8):764~774
[16]K. Klamroth, M. M.Wiecek. A time-dependent multiple criteria single-machine scheduling problem[J]. European Journal of Operational Research. 2001,135(1):17~26
[17]Maosatoshi Sakawa, Ryo Kubta.Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms[J]. European Journal of Operational Research,2000,120(2):393~407
[18]B. Paolo. Exploiting process plan flexibility in production scheduling: A multi-objective approach[J]. European Journal of Operational Research,1999,114(1): 59~71
[19]潘全科.智能制造系统多目标车间调度研究[D].南京:南京航空航天大学,2003
[20]Kiran A S, Smith M L. Simulation studies in job shop scheduling-I a survey[J] . Computer and Industry Enginieering. 1984,8(2):87~93
[21]W. Wang, D.W. Wang. JIT production planning approach with fuzzy due date for OKP manufacturing systems [J]. International Journal of Production Economics, 1999,58(2): 209~215
[22]S. Masatoshi, M. Tetsuya. An efficient genetic algorithm for job-shopscheduling problems with fuzzy processing time and fuzzy duedate[J]. Computers & Industrial Engineering, 1999,36(2): 325~341
[23]Chanas S,Kasperski A.Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing time and fuzzy due dates[J].Engineering Application of Artificial Intelligence,2001,14(3):377~386.
[24]S. Chanas, A. Kasperski. On two single machine scheduling problems with fuzzy processing times and fuzzy due dates[J]. European Journal of Operational Research,2003, 147(2): 281~296
[25]I.Takeshi, I. Hiroaki. Fuzzy due-date scheduling problem with fuzzy processing time[J]. International Transactions in Operational Research. 1999,6(6):639~647
[26] L. Marin, T. Roberto. Real-time task scheduling with fuzzy deadlines and processing times[J]. Fuzzy Sets and Systems, 2001,117(1):35~45
[27]Itoh. T et al. Fuzzy Due-date scheduling problem with Fuzzy process time[J]. International Transactions in operations research. 1999(6):639~647.
[28]Young Su Yun. Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems. Computer & industring,2002,43(4):623~644
[29]李平,顾幸生.不确定条件下不同交货期窗口的Job Shop调度[J].管理科学学报,2004,7 (2):22~26
[30]吴悦,汪定伟.模糊交货期窗口下极大化顾客满意数的最优调度[J].系统工程理论方法应用,1999,8(1):33~38
[31] G. Mosheiov, D. Oron. A note on the SPT heuristic for solving scheduling problems with generalized due dates[J]. Computers and Operations Research, 2004, 31(5):645~655
[32] V. Gordon, J.M. Proth, C.B. Chu. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1~25
[33]C.Y. Wang, D.W. Wang, W.H. Ip, et al. The single machine ready time scheduling problem with fuzzy processing times[J]. Fuzzy Sets and Systems,2002,127(2):117~129
[34]王成尧,高麟,汪定伟.模糊加工时间单机E/T调度问题的GA算法[J].控制与决策,1998, 13(增刊):418~427
[35]潘群.模糊加工时间的车间调度优化[J].经济师,2004,(5):283~284
[36]王成尧,高麟,汪定伟.模糊加工时间调度问题的研究[J].系统工程学报,1999,14(3):238~242
[37]孙志峻,朱剑英.用含机器人的生产车间双资源智能优化调度[J].机器人, 2002,24(4):39~42
[38] Johnson S. Optimal two-and-three stage production schedules with setup time include[J].Naval Research Logisttics Quarterly.1954,1:61~68
[39] A.H.G.Rinnooy.Kan. Machine Scheduling Problems: Classification[J]. Complexity and Computations. 1976,(1):76~83
[40] M.R. Garey, D.S. Johnson, R. Sethi. The complexity of flow shop and job- shop scheduling[J]. Math Operation Research.1976,(1):117~129
[41] F. Werner, A.Winkler. Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics[J]. 1995,58:191~211
[42] J.F.Muth, G.L. Thompson. Industrial Scheduling[M], Englewood Cliffs, New Jersey.1963
[43] J. Carlier, E.Pinson. An algorithm for solving the job shop problem[J]. Management Science. 1989,35(2):164~176
[44] T.C.E. Cheng, Z.L. Chen, N.V. Shakhlevich. Common due date assignment and scheduling with ready times[J]. Computers and Operations Research, 2002,29(14):1957~1967
[45] M.W. Park, Y.D. Kim. Search Heuristics for a Parallel Machine Scheduling Problemwith Ready Times and Due Dates[J]. Computers & Industrial ngineering, 1997,33(3-4):793~796
[46]杜玉祥,杜东雷,张国川.带准备时间的自由作业排序问题——最坏性能比分析[J].高校应用数学学报A辑(中文版),1997,12(2):191~196
[47]陈仕平,何勇,姚恩瑜.一类带机器准备时间的排序复杂性及算法[J].应用数学学报,1998,21 (3): 474~476
[48] A. Makoto, O. Hiroshi. Single machine scheduling to meet due times under hutdown constraints[J]. Int. J. Production Economics,1999, 60-61:537~547
[49] O. Holthaus. Scheduling in job shops with machine breakdowns: an experimental study[J]. Computers & Industrial Engineering,1999,36(1):137~162
[50] A. Susanne, S. Gunter. Scheduling with unexpected machine breakdowns[J]. Discrete Applied Mathematics,2001,110(2~3):85~99
[51]M. Feldmann,D. Biskup. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches[J]. Computers and Industrial Engineering. 2003,44(2):307~323
[52] M. K.ksalan, A. Burak Keha. Using genetic algorithms for single-machine bicriteria scheduling problems[J]. European Journal of Operational Research, 2003, 145(3):543~556
[53] A. Grosso, F.Della Croce, R. Tadei. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem[J]. Operations Research Letters,2004,32(1):68~72
[54] Z.J. Tian. Single-machine scheduling with release dates and due dates[D]. Department of Chemistry, The Hong Kong Polytechnic University, 2003
[55] C. Chekuri, R. Motwani. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine[J]. Discrete Applied Mathematics,1999,98(1):29~38
[56] T.C.Edwin Cheng, J. Adam, Y. Mikhail. Single machine batch scheduling with resource dependent setup and processing times[J]. European Journal of Operational Research, 2000,135(1):177~183
[57]马建辉,牛海军.提前/拖期惩罚的单机批调度优化问题研究[J].制造业自动化,2002,24 (7):65~67
[58]王秀利,吴惕华,刘磊.一种求解单机成组作业优化调度的启发算法[J].计算机仿真,2003,20(2):48~50
[59] Z.L. Chen, X.P. Zhao. Two Solvable Two-Machine Open Shop Scheduling Problems[J].Chinese Science Abstracts Series A, 1995, 14(5):10~14
[60] A.A. Gladky. A two-machine preemptive openshop scheduling problem: An elementaryproof of NP-completeness[J]. European Journal of Operational Research,1997, 103(1): 113~116
[61] S. A. Kravchenko. Minimizing the number of late jobs for the two-machineunit-time job-shop scheduling problem[J]. Discrete Applied Mathematics, 2000,98(3):209~217
[62]童刚,李光泉,刘宝坤.用遗传算法解决在并行机上带有不同交货期窗口的Job-Shop调度问题[J].系统工程,2000,18(3):37~42
[63] J. Hurink, S. Knust. List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters,2001,29(5):231~239
[64]孙志峻.智能制造系统车间生产优化调度[D].南京:南京航空航天大学,2002
[65] T. Tautenhahn, G. J. Woeginger. Minimizing the total completion time in a unit-time open shop with release times[J]. Operations Research Letters.1997,20(5):207~212
[66] C. Phillips, C. Stein, J. Wein. Minimizing average completion time in the presence of release dates[J]. Mathematical Programming,1998,82(1-2):199~223
[67] A. Kononov, M. Sviridenko. A linear time approximation scheme for makespan minimization in an open shop with release dates[J]. Operations Research Letters,2002,30(4):276~280
[68] Y. Zinder. An iterative algorithm for scheduling UET tasks with due dates and release times[J]. European Journal of Operational Research, 2003,149(2):326~338
[69]张晓坤,彭炎午,耿峰.车间作业的混合组合规则调度方法[J].西北工业大学学报,1996, 14(4): 627~632
[70]陈秋双,齐向彤,涂奉生. JOB SHOP投入控制与调度研究[J].系统工程学报,1997,12(2): 49~56
[71] G. Steiner. Minimizing the number of tardy jobs with precedence constraints and agreeable due dates[J].Discrete Applied Mathematics,1997, 72(1-2):167~177
[72]Valery Gordon,Jean MarieProth and Chengbin Chu. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1~25
[73] C.L. Li, C.Y. Lee. Scheduling with agreeable release times and due dates on a batch processing machine[J]. European Journal of Operational Research,1997,96(3):564~569
[74]康宁,王凤儒,刘丕娥.有交货期的单件车间调度问题的逆序算法[J].系统工程理论与实践, 1999,(12):25~30
[75]王莉,李大卫,王梦光.带有交货期窗口的调度问题及算法[J].系统工程学报,1998,13(4): 16~23
[76]王玮,汪定伟.单件制造企业交货期窗口下的提前/拖期生产计划模型研究[J].系统工程理论方法应用,1998,7(1):17~22
[77]王莉,李大卫,王梦光.不同交货期窗口下的提前/拖期调度问题[J].控制理论与应用, 1998,15(5):759~763
[78]刘兴初,赵千川,郑大钟.用GA算法解不同交货期窗口下的E/T调度问题[J].清华大学学报(自然科学版), 2000,40(7):59~62
[79]Z.L. Chen, C.Y. Lee. Parallel machine scheduling with a common due window[J].European Journal of Operational Research,2002,136(3):512~527
[80]黄德才,张平.公共交货期窗口下提前/拖期问题的多机调度算法[J].系统工程,1999,17 (6):37~40
[81]贾春福.加工时间服从指数分布单机随机调度[J].系统工程, 2002,20(6):58~61
[82]R. Ghaith, M. Mansooreh, C. Georgios. Anagnostopoulos. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time[J]. Computers & Operations Research,2004,31(10): 1727~1751
[83] G. Michel, L. Gilbert, M. G. Eduardo. A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times[J]. European Journal of Operational Research, 2001,133(1):183~189
[84] A. Christian, F. Roubellat. A Petri net model and a general method for on and off-linemulti-resource shop foor scheduling with setup times[J]. International Journal of Production Economics,2001,74 (1-3):63~75
[85]V.A. Strusevich. Group technology approach to the open shop scheduling problem with batch setup times[J]. Operations Research Letters,2000,26(4):181~192
[86] Z.L. Chen. Scheduling with batch setup times and earliness-tardiness penalties[J]. European Journal of Operational Research, 1997,96(3):518~537
[87] N.D.G. Jatinder, C.H. Johnny. Scheduling with two job classes and setup times to minimize the number of tardy jobs[J]. International Journal of Production Economics, 1996,42(3):205~216
[88]C.Jordan,A two-phase genetic algorithm to solve variants of the batch sequencing problem[J].Int. J. of production research,1998,36(3):745~760
[89] E.Kenneth, Mcgraw, Maged M.D.. Sequence-dependent batch chemical scheduling with earliness and ardiness penalties[J]. Int. J. of production research, 2001, 39(14):3085~3107
[90]T.C.Edwin Cheng, Y. K. Mikhail. Single machine batch scheduling with deadlines and resource dependent processing time[J]. Operations Research Letters, 1995,17(5): 243~249
[91]Lee Y.G.and Malon M.F. Batch process scheduling optimization under parametervolatility[J]. Int. J. of production research, 2001, 39(4):602~623
[92]B. Heidemarie, H. Holger. On the open-shop problem with preemption and minimizing the average completion time[J]. European Journal of Operational Research,2004,157(3): 607~619
[93] B.Chen, V. V. André, G.J. Woeginger. An optimal algorithm for preemptive on-line scheduling[J]. Operations Research Letters,1995,18(3):127~131
[94]L. Epstein, L. M. Favrholdt. Optimal preemptive semi-online scheduling to minimize makespan on two related machines[J]. Operations Research Letters, 2002,30(4):269~275
[95]杨斌鑫,刘小冬,成龙.单机排序问题1| rj , prmp |∑ωf(1- eacj )的动态在线调度[J].运筹与管理,2004,13(1):23~26
[96]金宏,王宏安,王强等.模糊动态抢占调度算法[J].计算机学报, 2004, 27(6): 812~817
[97]S.T. Christoph. Job shop scheduling with alternative process plans[J]. Int. J. Production Economics,2001,74(1-3):125~134
[98]K. K. Yeo, P. Kitae, K. Jesuk. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling[J]. Computers & Operations Research,2003,30(8):1151~1171
[99]李言,李淑娟,郑建明等.工艺设计对生产调度结果的影响[J] .中国机械工程,2000,11(4):402~405
[100] R.R.Ramesh.Computer-intergrated process planning and scheduling(CIPPS): intelligent support for product design,process planning and control[J]. Int. J. Prod. Res., 1999, 37(3)481~500.
[101]熊禾根.模具企业动态车间作业计划研究[D].武汉:华中科技大学,2005
[102]郑大钟,赵千川.离散事件动态系统(第一版)[M].北京:清华大学出版社,2001:352~360
[103] R. Ghaith, M. Mansooreh, C. Georgios. Anagnostopoulos. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Computers & Operations Research,2004,31(10): 1727~1751
[104] R. Xiong, Y.S. Fan, C. Wu. A Dynamic job Shop Scheduling Method Based on Lagrangian Relaxation. Tsinghua Science and Technology, 1999,4(1):1297~1302
[105] Q.C. Huang, Q. Chen, R.Z. Yu. A fast job oriented scheduling algorithm. Journal of Software,1999,10(10):1073~1077.
[106] C. Rajendran, O. Holthaus. A comparative study of dispatching rules in dynamic flowshops and job shops.European Journal of Operational Research, 1999,116(1):156~170
[107] J. T. Naidu. A note on a well-know dispatching rule to minimize total tardiness. International Journal of Management Science, 2003,31(2):137~140.
[108] F. Pezzella, E. Merelli. A tabu search method guided by shifting bottleneck for thejob shop scheduling problem. European Journal of Operational Research,2000, 120(2):297~310
[109] I. Sabuncuoglu, M. Bayiz. Job shop scheduling with beam search. European Journal of Operational Research, 1999,118(2):390~412
[110] J. Herrmann, J.M. Proth, N. Sauer. Heuristics for unrelated machine scheduling with precedence constraints[J]. European Journal of Operational Research. 1997, 102(3):528~537
[111]王睿智,刘鸿雁,吕红.有优先顺序约束的单件车间调度问题的一种启发式算法[J].计算机应用与软件,2003,(1):56~57
[112] W.H.M. Raaymakers, J.A. Hoogeveen. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research,2000,126(1):131~151
[113] K. Steinhfel, A. Albrecht, C.K. Wong. Two simulated annealing-based heuristics for the job shop scheduling problem .European Journal of Operational Research,1999, 118(3):524~548
[114] V. Amaral Armentano, C. Rigao Scrich. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics,2000,63(2):131~140
[115] D Peres and J Paulli. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problems using taboo search[J]. Annals of Operations Research, 1997,70(2):281~306.
[116] M Mastrolilli and L M Gambardella. Effective neighborhood function for job shop scheduling problems[J]. Journal of Scheduling, 2002,3(1):3~20.
[117] N. Mladenovic, P. Hansen. Variable neighborhood search. Computers & Operations Research,1997,24(11):1097~1100
[118] P. Hansen, N. Mladenovic. Variable neighborhood search: Principles and applications. European Journal of Operational Research,2001,130(3):449~467
[119] D.J. Fonseca, D. Navaresse. Artificial neural networks for job shop simulation. Advanced Engineering Informatics,2002,16(4):241~246
[120] C. Blum. Beam-ACO—hybridizing ant colony optimization with beam search: anapplication to open shop scheduling. Computers and Operations Research,2005,32(6): 1565~1591
[121] S.J. Shyu, B.M.T. Lin, P.Y. Yin. Application of ant colony optimization for no-waitflowshop scheduling problem to minimize the total completion time. Computersand Industrial Engineering,2004, 47(2-3):181~193
[122]朱剑英.智能系统非经典数学方法[M].武汉:华中科技大学出版社,2001年4月
[123]陈雄.智能算法及其在生产调度中的应用研究:[博士后研究工作报告].上海:同济大学,2001年3月
[124]张超勇,饶运清,李培根,刘向军.求解作业车间调度问题的一种改进遗传算法[J].计算机集成制造.2004,10(8):966~970
[125]徐琦.遗传算法的改进及其应用研究[D].武汉:华中科技大学,2001年1月
[126]张晓缋,戴冠中,徐乃平.遗传算法种群多样性的分析研究[J].控制理论与应用,1998,15(1):17~22
[127]丛明煜,王丽平.智能化遗传算法[J].高技术通讯,2003,13(4):43~47
[128]方剑,席裕庚.基于遗传算法的JOB SHOP静态调度算法[J].上海交通大学学报, 1997,31(3): 49~52
[129]方剑,席裕庚.基于遗传算法的滚动调度策略[J].控制理论与应用. 1997,14(4):589~594
[130] Xia Weijun et al. A new Hybrid Optimization Algorithm for the Job-shop Scheduling Problem. Proceeding of the 2004 American Control Conference, Boston, Massachusetts June 30-July 2,2004:5552~5557
[131] M.F.Tasgetiren,M.Sevkli,Y.C.Liang et.al. Particle swarm Optimization algorithm for permutation flowshop sequencing problem[J].Lecture Notes in Computer Science, 2005, (3172):382~389
[132] K.Rameshkumar et al. Discrete Particle Swarm Optimization(DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan. Lecture Notes in Computer Science, 2005 (3612):572~581
[133] Kennedy J., Eberhart R.. Particle swarm optimization. Proceeding of IEEE international conference on Neural Network, 1995,IV: 1942~1948
[134] Kennedy J., Eberhart R..A discrete binary version of the Particle swarm optimization algorithm. Proceeding of the 1997 conference. on System, Man and Cybernetics (SMC’97). 1997,4104~4109
[135] Shi Y., Eberhart R.. Fuzzy Adaptive Particle swarm optimization. Proceeding of IEEE conference on Evolutionary Computation (CEC2001), Seoul, Korea, 2001,1473~1785
[136]那加.基于自适应变异的粒子群优化算法的作业车间调度优化及其软件实现[J].信息与控制.2005,34(3):365~36
[137] A.Kimms. A genetic algorithm for multi-level multi-machine lot sizing and scheduling[J].Computers & Operations Research,1999,26[6]:829~848
[138] Lasserre J B.An integrated model for job-shop planning andscheduling[J].ManagementScience.1992,38(8):1201~1211
[139] Anwarmf, Nagir. Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-up[J]. International Journal of Production Research, 1997,35(5):1447~1470
[140] C.Guettier,B.Allo and V..Legendre.Constraint model-base planning and scheduling with multiple resources and complex collaboration schema. www.aaai.org
[141] Ruhul Sarker, Charles Newton. A genetic algorithm for solving economic lot size scheduling problem. Computer & industrial engineering,2002 42(2):189~198
[142] Wolfgang Bruggemann,Hermann Jahnke. The diserete lot-sixing and scheduling problem:Complxity and modification for batch availability[J]. European Journal of Operational Research,2000,124(3):511~528
[143] Herbert Jodlbauer.An approach for intergrated scheduling and lot-sizing[J].E uropean Journal of Operational Research,2004,150(1):1~18
[144] Knut Haase, Alf Kimms. Lot sizing and scheduling with sequence-dependent setup costs and time and dfficient rescheduling opportunities[J].Int. J.production Economics,2000,66(2):159~169
[145] W.H.Ip,Y.Li,K.F.Man et al.Multi-product planning and scheduling using genetic algorithmn approach[J].Computers & Industrial Engineering,2000,38(2):283~296.
[146]熊锐,陈浩勋,胡保生.一种生产计划与车间调度的集成模型及其拉氏松弛求解法[J] .西安电子科技大学学报,1996,23(4):509~516
[147] X.D.Zhang,H.S.Yan. Intergrated optimization of production planning and scheduling for a kind of job-shop[J]. International Journal of Advanced Manufacture Technology.2005,26(8):876~886
[148]张晓东,严洪森.一类Job_shop车间生产计划和调度的集成优化[J].控制与决策.2003,18(5):581~584
[149]严洪森,夏琦峰,朱闵如等.汽车装配车间生产计划与调度的同时优化方法.自动化学报,2002,28(6):911~919
[150]张晓东,严洪森.多级车间生产计划与调度的集成优化[J].机械工程学报.2005,41(9):98~105
[151]司书宾,孙树栋.批量生产企业的车间计划调度算法研究与应用[J].计算机工程与应用.2005,41(27):196~201
[152]尚文利,范玉顺.成批生产计划调度的集成建模与优化[J].计算机集成制造系统.2005,11(12):1663~1667
[153]林慧苹,范玉顺,吴澄.基于分层调度模型的生产计划和调度集成研究[J].计算机集成制造系统,2002,8(8):602~606
[154]熊红云,何钺.面向柔性生产线的分批与调度集成模型及其遗传算法[J].长沙铁道学院学报,2001,19(1):51~55
[155]刘世平,张洁,饶运清,李培根.基于多代理技术的车间计划与调度研究[J].机械与电子,2001,8(5):28~31
[156]朱灏等[147],杨殿.待料型生产计划与调度优化模型[J] .系统工程,2005,23(12):35~38
[157]徐和平,王德国,孙林岩.多阶段制造系统的生产计划与调度综合模型[J] .兰州理工大学学报,2004,30(3):127~129
[158] Bruker P, Schlie R. Job shop scheduling with multi-purpose machines[J]. Computing.1990,45(2):369~375.
[2]何霆,刘飞,马玉林.车间生产调度问题研究[J].机械工程学报. 2000,36(5):97~102
[3] Stenphe C Gravesr. A Review of Production Scheduling[J]. Production Scheduling, 1981,29(4):646~675
[4] Pinedo M. Scheduling theory,algorithms and Systems[M].Prentice Hall,Second Edition,2002.
[5] Yamamoto M. and Nof S. Y., Scheduling/rescheduling in the manufacturing operation system environment [J]. International Journal of Production Research, 1985,23(5):705~722.
[6] Imed Kacem, Slim Hammadi and Pierre Borne. Approach by localization and multiobjective evolutionary optimixation for flexible job-shop scheduling problems[J]. IEEE Transaction on Systems,Man, and Cybernetics,Part C: Application and reviews,2002,3(1):1~13.
[7] I Kacem, S Hammadi and P Borne. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic[J]. Mathematics and Computers in simulation, 2002,60(2) :245~276
[8] Qiao Bing, et al. Solving Flexible Job Shop Scheduling Problem by Genetic Algorithms[J]. Transactions of Nanjing University of Aeronautics &Astronautics, 2001,18(1):108~112.
[9]孙志峻,朱剑英.具有柔性加工路径的作业车间智能优化调度[J].机械科学与技术, 2001,20(6): 45~49
[10]孙志峻,乔冰,潘全科等.具有柔性加工路径的作业车间批量调度优化研究[J].机械科学与技术,2002,21(3):348~354
[11]Nabil Nasr, Elsayed E A. Job shop scheduling with alternative machines[J].International Journal of production Research,1990,28(9):1595~1609
[12]Weijun Xia, Zhiming Wu. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems[J]. Computers & Industrial Engineering, 2005,48(3) :409~425.
[13]Brandimarte P. Routing and scheduling in a flexible job shop by taboo search[J]. Annals of Operation Research. 1993, 41(1):157~183
[14]Amit Nagar, Jorge Haddock and Sunderesh Heragu. Multiple and bicriteria scheduling:A literature survey[J]. European Journal of Operational Research, 1995,81(1):88~104
[15]S G Ponnamblam,V.Ramkumar. A multiobjective genetic algorithm for job shop scheduling[J]. Production Planning &Control. 2001,12(8):764~774
[16]K. Klamroth, M. M.Wiecek. A time-dependent multiple criteria single-machine scheduling problem[J]. European Journal of Operational Research. 2001,135(1):17~26
[17]Maosatoshi Sakawa, Ryo Kubta.Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms[J]. European Journal of Operational Research,2000,120(2):393~407
[18]B. Paolo. Exploiting process plan flexibility in production scheduling: A multi-objective approach[J]. European Journal of Operational Research,1999,114(1): 59~71
[19]潘全科.智能制造系统多目标车间调度研究[D].南京:南京航空航天大学,2003
[20]Kiran A S, Smith M L. Simulation studies in job shop scheduling-I a survey[J] . Computer and Industry Enginieering. 1984,8(2):87~93
[21]W. Wang, D.W. Wang. JIT production planning approach with fuzzy due date for OKP manufacturing systems [J]. International Journal of Production Economics, 1999,58(2): 209~215
[22]S. Masatoshi, M. Tetsuya. An efficient genetic algorithm for job-shopscheduling problems with fuzzy processing time and fuzzy duedate[J]. Computers & Industrial Engineering, 1999,36(2): 325~341
[23]Chanas S,Kasperski A.Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing time and fuzzy due dates[J].Engineering Application of Artificial Intelligence,2001,14(3):377~386.
[24]S. Chanas, A. Kasperski. On two single machine scheduling problems with fuzzy processing times and fuzzy due dates[J]. European Journal of Operational Research,2003, 147(2): 281~296
[25]I.Takeshi, I. Hiroaki. Fuzzy due-date scheduling problem with fuzzy processing time[J]. International Transactions in Operational Research. 1999,6(6):639~647
[26] L. Marin, T. Roberto. Real-time task scheduling with fuzzy deadlines and processing times[J]. Fuzzy Sets and Systems, 2001,117(1):35~45
[27]Itoh. T et al. Fuzzy Due-date scheduling problem with Fuzzy process time[J]. International Transactions in operations research. 1999(6):639~647.
[28]Young Su Yun. Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems. Computer & industring,2002,43(4):623~644
[29]李平,顾幸生.不确定条件下不同交货期窗口的Job Shop调度[J].管理科学学报,2004,7 (2):22~26
[30]吴悦,汪定伟.模糊交货期窗口下极大化顾客满意数的最优调度[J].系统工程理论方法应用,1999,8(1):33~38
[31] G. Mosheiov, D. Oron. A note on the SPT heuristic for solving scheduling problems with generalized due dates[J]. Computers and Operations Research, 2004, 31(5):645~655
[32] V. Gordon, J.M. Proth, C.B. Chu. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1~25
[33]C.Y. Wang, D.W. Wang, W.H. Ip, et al. The single machine ready time scheduling problem with fuzzy processing times[J]. Fuzzy Sets and Systems,2002,127(2):117~129
[34]王成尧,高麟,汪定伟.模糊加工时间单机E/T调度问题的GA算法[J].控制与决策,1998, 13(增刊):418~427
[35]潘群.模糊加工时间的车间调度优化[J].经济师,2004,(5):283~284
[36]王成尧,高麟,汪定伟.模糊加工时间调度问题的研究[J].系统工程学报,1999,14(3):238~242
[37]孙志峻,朱剑英.用含机器人的生产车间双资源智能优化调度[J].机器人, 2002,24(4):39~42
[38] Johnson S. Optimal two-and-three stage production schedules with setup time include[J].Naval Research Logisttics Quarterly.1954,1:61~68
[39] A.H.G.Rinnooy.Kan. Machine Scheduling Problems: Classification[J]. Complexity and Computations. 1976,(1):76~83
[40] M.R. Garey, D.S. Johnson, R. Sethi. The complexity of flow shop and job- shop scheduling[J]. Math Operation Research.1976,(1):117~129
[41] F. Werner, A.Winkler. Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics[J]. 1995,58:191~211
[42] J.F.Muth, G.L. Thompson. Industrial Scheduling[M], Englewood Cliffs, New Jersey.1963
[43] J. Carlier, E.Pinson. An algorithm for solving the job shop problem[J]. Management Science. 1989,35(2):164~176
[44] T.C.E. Cheng, Z.L. Chen, N.V. Shakhlevich. Common due date assignment and scheduling with ready times[J]. Computers and Operations Research, 2002,29(14):1957~1967
[45] M.W. Park, Y.D. Kim. Search Heuristics for a Parallel Machine Scheduling Problemwith Ready Times and Due Dates[J]. Computers & Industrial ngineering, 1997,33(3-4):793~796
[46]杜玉祥,杜东雷,张国川.带准备时间的自由作业排序问题——最坏性能比分析[J].高校应用数学学报A辑(中文版),1997,12(2):191~196
[47]陈仕平,何勇,姚恩瑜.一类带机器准备时间的排序复杂性及算法[J].应用数学学报,1998,21 (3): 474~476
[48] A. Makoto, O. Hiroshi. Single machine scheduling to meet due times under hutdown constraints[J]. Int. J. Production Economics,1999, 60-61:537~547
[49] O. Holthaus. Scheduling in job shops with machine breakdowns: an experimental study[J]. Computers & Industrial Engineering,1999,36(1):137~162
[50] A. Susanne, S. Gunter. Scheduling with unexpected machine breakdowns[J]. Discrete Applied Mathematics,2001,110(2~3):85~99
[51]M. Feldmann,D. Biskup. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches[J]. Computers and Industrial Engineering. 2003,44(2):307~323
[52] M. K.ksalan, A. Burak Keha. Using genetic algorithms for single-machine bicriteria scheduling problems[J]. European Journal of Operational Research, 2003, 145(3):543~556
[53] A. Grosso, F.Della Croce, R. Tadei. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem[J]. Operations Research Letters,2004,32(1):68~72
[54] Z.J. Tian. Single-machine scheduling with release dates and due dates[D]. Department of Chemistry, The Hong Kong Polytechnic University, 2003
[55] C. Chekuri, R. Motwani. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine[J]. Discrete Applied Mathematics,1999,98(1):29~38
[56] T.C.Edwin Cheng, J. Adam, Y. Mikhail. Single machine batch scheduling with resource dependent setup and processing times[J]. European Journal of Operational Research, 2000,135(1):177~183
[57]马建辉,牛海军.提前/拖期惩罚的单机批调度优化问题研究[J].制造业自动化,2002,24 (7):65~67
[58]王秀利,吴惕华,刘磊.一种求解单机成组作业优化调度的启发算法[J].计算机仿真,2003,20(2):48~50
[59] Z.L. Chen, X.P. Zhao. Two Solvable Two-Machine Open Shop Scheduling Problems[J].Chinese Science Abstracts Series A, 1995, 14(5):10~14
[60] A.A. Gladky. A two-machine preemptive openshop scheduling problem: An elementaryproof of NP-completeness[J]. European Journal of Operational Research,1997, 103(1): 113~116
[61] S. A. Kravchenko. Minimizing the number of late jobs for the two-machineunit-time job-shop scheduling problem[J]. Discrete Applied Mathematics, 2000,98(3):209~217
[62]童刚,李光泉,刘宝坤.用遗传算法解决在并行机上带有不同交货期窗口的Job-Shop调度问题[J].系统工程,2000,18(3):37~42
[63] J. Hurink, S. Knust. List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters,2001,29(5):231~239
[64]孙志峻.智能制造系统车间生产优化调度[D].南京:南京航空航天大学,2002
[65] T. Tautenhahn, G. J. Woeginger. Minimizing the total completion time in a unit-time open shop with release times[J]. Operations Research Letters.1997,20(5):207~212
[66] C. Phillips, C. Stein, J. Wein. Minimizing average completion time in the presence of release dates[J]. Mathematical Programming,1998,82(1-2):199~223
[67] A. Kononov, M. Sviridenko. A linear time approximation scheme for makespan minimization in an open shop with release dates[J]. Operations Research Letters,2002,30(4):276~280
[68] Y. Zinder. An iterative algorithm for scheduling UET tasks with due dates and release times[J]. European Journal of Operational Research, 2003,149(2):326~338
[69]张晓坤,彭炎午,耿峰.车间作业的混合组合规则调度方法[J].西北工业大学学报,1996, 14(4): 627~632
[70]陈秋双,齐向彤,涂奉生. JOB SHOP投入控制与调度研究[J].系统工程学报,1997,12(2): 49~56
[71] G. Steiner. Minimizing the number of tardy jobs with precedence constraints and agreeable due dates[J].Discrete Applied Mathematics,1997, 72(1-2):167~177
[72]Valery Gordon,Jean MarieProth and Chengbin Chu. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1~25
[73] C.L. Li, C.Y. Lee. Scheduling with agreeable release times and due dates on a batch processing machine[J]. European Journal of Operational Research,1997,96(3):564~569
[74]康宁,王凤儒,刘丕娥.有交货期的单件车间调度问题的逆序算法[J].系统工程理论与实践, 1999,(12):25~30
[75]王莉,李大卫,王梦光.带有交货期窗口的调度问题及算法[J].系统工程学报,1998,13(4): 16~23
[76]王玮,汪定伟.单件制造企业交货期窗口下的提前/拖期生产计划模型研究[J].系统工程理论方法应用,1998,7(1):17~22
[77]王莉,李大卫,王梦光.不同交货期窗口下的提前/拖期调度问题[J].控制理论与应用, 1998,15(5):759~763
[78]刘兴初,赵千川,郑大钟.用GA算法解不同交货期窗口下的E/T调度问题[J].清华大学学报(自然科学版), 2000,40(7):59~62
[79]Z.L. Chen, C.Y. Lee. Parallel machine scheduling with a common due window[J].European Journal of Operational Research,2002,136(3):512~527
[80]黄德才,张平.公共交货期窗口下提前/拖期问题的多机调度算法[J].系统工程,1999,17 (6):37~40
[81]贾春福.加工时间服从指数分布单机随机调度[J].系统工程, 2002,20(6):58~61
[82]R. Ghaith, M. Mansooreh, C. Georgios. Anagnostopoulos. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time[J]. Computers & Operations Research,2004,31(10): 1727~1751
[83] G. Michel, L. Gilbert, M. G. Eduardo. A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times[J]. European Journal of Operational Research, 2001,133(1):183~189
[84] A. Christian, F. Roubellat. A Petri net model and a general method for on and off-linemulti-resource shop foor scheduling with setup times[J]. International Journal of Production Economics,2001,74 (1-3):63~75
[85]V.A. Strusevich. Group technology approach to the open shop scheduling problem with batch setup times[J]. Operations Research Letters,2000,26(4):181~192
[86] Z.L. Chen. Scheduling with batch setup times and earliness-tardiness penalties[J]. European Journal of Operational Research, 1997,96(3):518~537
[87] N.D.G. Jatinder, C.H. Johnny. Scheduling with two job classes and setup times to minimize the number of tardy jobs[J]. International Journal of Production Economics, 1996,42(3):205~216
[88]C.Jordan,A two-phase genetic algorithm to solve variants of the batch sequencing problem[J].Int. J. of production research,1998,36(3):745~760
[89] E.Kenneth, Mcgraw, Maged M.D.. Sequence-dependent batch chemical scheduling with earliness and ardiness penalties[J]. Int. J. of production research, 2001, 39(14):3085~3107
[90]T.C.Edwin Cheng, Y. K. Mikhail. Single machine batch scheduling with deadlines and resource dependent processing time[J]. Operations Research Letters, 1995,17(5): 243~249
[91]Lee Y.G.and Malon M.F. Batch process scheduling optimization under parametervolatility[J]. Int. J. of production research, 2001, 39(4):602~623
[92]B. Heidemarie, H. Holger. On the open-shop problem with preemption and minimizing the average completion time[J]. European Journal of Operational Research,2004,157(3): 607~619
[93] B.Chen, V. V. André, G.J. Woeginger. An optimal algorithm for preemptive on-line scheduling[J]. Operations Research Letters,1995,18(3):127~131
[94]L. Epstein, L. M. Favrholdt. Optimal preemptive semi-online scheduling to minimize makespan on two related machines[J]. Operations Research Letters, 2002,30(4):269~275
[95]杨斌鑫,刘小冬,成龙.单机排序问题1| rj , prmp |∑ωf(1- eacj )的动态在线调度[J].运筹与管理,2004,13(1):23~26
[96]金宏,王宏安,王强等.模糊动态抢占调度算法[J].计算机学报, 2004, 27(6): 812~817
[97]S.T. Christoph. Job shop scheduling with alternative process plans[J]. Int. J. Production Economics,2001,74(1-3):125~134
[98]K. K. Yeo, P. Kitae, K. Jesuk. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling[J]. Computers & Operations Research,2003,30(8):1151~1171
[99]李言,李淑娟,郑建明等.工艺设计对生产调度结果的影响[J] .中国机械工程,2000,11(4):402~405
[100] R.R.Ramesh.Computer-intergrated process planning and scheduling(CIPPS): intelligent support for product design,process planning and control[J]. Int. J. Prod. Res., 1999, 37(3)481~500.
[101]熊禾根.模具企业动态车间作业计划研究[D].武汉:华中科技大学,2005
[102]郑大钟,赵千川.离散事件动态系统(第一版)[M].北京:清华大学出版社,2001:352~360
[103] R. Ghaith, M. Mansooreh, C. Georgios. Anagnostopoulos. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Computers & Operations Research,2004,31(10): 1727~1751
[104] R. Xiong, Y.S. Fan, C. Wu. A Dynamic job Shop Scheduling Method Based on Lagrangian Relaxation. Tsinghua Science and Technology, 1999,4(1):1297~1302
[105] Q.C. Huang, Q. Chen, R.Z. Yu. A fast job oriented scheduling algorithm. Journal of Software,1999,10(10):1073~1077.
[106] C. Rajendran, O. Holthaus. A comparative study of dispatching rules in dynamic flowshops and job shops.European Journal of Operational Research, 1999,116(1):156~170
[107] J. T. Naidu. A note on a well-know dispatching rule to minimize total tardiness. International Journal of Management Science, 2003,31(2):137~140.
[108] F. Pezzella, E. Merelli. A tabu search method guided by shifting bottleneck for thejob shop scheduling problem. European Journal of Operational Research,2000, 120(2):297~310
[109] I. Sabuncuoglu, M. Bayiz. Job shop scheduling with beam search. European Journal of Operational Research, 1999,118(2):390~412
[110] J. Herrmann, J.M. Proth, N. Sauer. Heuristics for unrelated machine scheduling with precedence constraints[J]. European Journal of Operational Research. 1997, 102(3):528~537
[111]王睿智,刘鸿雁,吕红.有优先顺序约束的单件车间调度问题的一种启发式算法[J].计算机应用与软件,2003,(1):56~57
[112] W.H.M. Raaymakers, J.A. Hoogeveen. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research,2000,126(1):131~151
[113] K. Steinhfel, A. Albrecht, C.K. Wong. Two simulated annealing-based heuristics for the job shop scheduling problem .European Journal of Operational Research,1999, 118(3):524~548
[114] V. Amaral Armentano, C. Rigao Scrich. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics,2000,63(2):131~140
[115] D Peres and J Paulli. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problems using taboo search[J]. Annals of Operations Research, 1997,70(2):281~306.
[116] M Mastrolilli and L M Gambardella. Effective neighborhood function for job shop scheduling problems[J]. Journal of Scheduling, 2002,3(1):3~20.
[117] N. Mladenovic, P. Hansen. Variable neighborhood search. Computers & Operations Research,1997,24(11):1097~1100
[118] P. Hansen, N. Mladenovic. Variable neighborhood search: Principles and applications. European Journal of Operational Research,2001,130(3):449~467
[119] D.J. Fonseca, D. Navaresse. Artificial neural networks for job shop simulation. Advanced Engineering Informatics,2002,16(4):241~246
[120] C. Blum. Beam-ACO—hybridizing ant colony optimization with beam search: anapplication to open shop scheduling. Computers and Operations Research,2005,32(6): 1565~1591
[121] S.J. Shyu, B.M.T. Lin, P.Y. Yin. Application of ant colony optimization for no-waitflowshop scheduling problem to minimize the total completion time. Computersand Industrial Engineering,2004, 47(2-3):181~193
[122]朱剑英.智能系统非经典数学方法[M].武汉:华中科技大学出版社,2001年4月
[123]陈雄.智能算法及其在生产调度中的应用研究:[博士后研究工作报告].上海:同济大学,2001年3月
[124]张超勇,饶运清,李培根,刘向军.求解作业车间调度问题的一种改进遗传算法[J].计算机集成制造.2004,10(8):966~970
[125]徐琦.遗传算法的改进及其应用研究[D].武汉:华中科技大学,2001年1月
[126]张晓缋,戴冠中,徐乃平.遗传算法种群多样性的分析研究[J].控制理论与应用,1998,15(1):17~22
[127]丛明煜,王丽平.智能化遗传算法[J].高技术通讯,2003,13(4):43~47
[128]方剑,席裕庚.基于遗传算法的JOB SHOP静态调度算法[J].上海交通大学学报, 1997,31(3): 49~52
[129]方剑,席裕庚.基于遗传算法的滚动调度策略[J].控制理论与应用. 1997,14(4):589~594
[130] Xia Weijun et al. A new Hybrid Optimization Algorithm for the Job-shop Scheduling Problem. Proceeding of the 2004 American Control Conference, Boston, Massachusetts June 30-July 2,2004:5552~5557
[131] M.F.Tasgetiren,M.Sevkli,Y.C.Liang et.al. Particle swarm Optimization algorithm for permutation flowshop sequencing problem[J].Lecture Notes in Computer Science, 2005, (3172):382~389
[132] K.Rameshkumar et al. Discrete Particle Swarm Optimization(DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan. Lecture Notes in Computer Science, 2005 (3612):572~581
[133] Kennedy J., Eberhart R.. Particle swarm optimization. Proceeding of IEEE international conference on Neural Network, 1995,IV: 1942~1948
[134] Kennedy J., Eberhart R..A discrete binary version of the Particle swarm optimization algorithm. Proceeding of the 1997 conference. on System, Man and Cybernetics (SMC’97). 1997,4104~4109
[135] Shi Y., Eberhart R.. Fuzzy Adaptive Particle swarm optimization. Proceeding of IEEE conference on Evolutionary Computation (CEC2001), Seoul, Korea, 2001,1473~1785
[136]那加.基于自适应变异的粒子群优化算法的作业车间调度优化及其软件实现[J].信息与控制.2005,34(3):365~36
[137] A.Kimms. A genetic algorithm for multi-level multi-machine lot sizing and scheduling[J].Computers & Operations Research,1999,26[6]:829~848
[138] Lasserre J B.An integrated model for job-shop planning andscheduling[J].ManagementScience.1992,38(8):1201~1211
[139] Anwarmf, Nagir. Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-up[J]. International Journal of Production Research, 1997,35(5):1447~1470
[140] C.Guettier,B.Allo and V..Legendre.Constraint model-base planning and scheduling with multiple resources and complex collaboration schema. www.aaai.org
[141] Ruhul Sarker, Charles Newton. A genetic algorithm for solving economic lot size scheduling problem. Computer & industrial engineering,2002 42(2):189~198
[142] Wolfgang Bruggemann,Hermann Jahnke. The diserete lot-sixing and scheduling problem:Complxity and modification for batch availability[J]. European Journal of Operational Research,2000,124(3):511~528
[143] Herbert Jodlbauer.An approach for intergrated scheduling and lot-sizing[J].E uropean Journal of Operational Research,2004,150(1):1~18
[144] Knut Haase, Alf Kimms. Lot sizing and scheduling with sequence-dependent setup costs and time and dfficient rescheduling opportunities[J].Int. J.production Economics,2000,66(2):159~169
[145] W.H.Ip,Y.Li,K.F.Man et al.Multi-product planning and scheduling using genetic algorithmn approach[J].Computers & Industrial Engineering,2000,38(2):283~296.
[146]熊锐,陈浩勋,胡保生.一种生产计划与车间调度的集成模型及其拉氏松弛求解法[J] .西安电子科技大学学报,1996,23(4):509~516
[147] X.D.Zhang,H.S.Yan. Intergrated optimization of production planning and scheduling for a kind of job-shop[J]. International Journal of Advanced Manufacture Technology.2005,26(8):876~886
[148]张晓东,严洪森.一类Job_shop车间生产计划和调度的集成优化[J].控制与决策.2003,18(5):581~584
[149]严洪森,夏琦峰,朱闵如等.汽车装配车间生产计划与调度的同时优化方法.自动化学报,2002,28(6):911~919
[150]张晓东,严洪森.多级车间生产计划与调度的集成优化[J].机械工程学报.2005,41(9):98~105
[151]司书宾,孙树栋.批量生产企业的车间计划调度算法研究与应用[J].计算机工程与应用.2005,41(27):196~201
[152]尚文利,范玉顺.成批生产计划调度的集成建模与优化[J].计算机集成制造系统.2005,11(12):1663~1667
[153]林慧苹,范玉顺,吴澄.基于分层调度模型的生产计划和调度集成研究[J].计算机集成制造系统,2002,8(8):602~606
[154]熊红云,何钺.面向柔性生产线的分批与调度集成模型及其遗传算法[J].长沙铁道学院学报,2001,19(1):51~55
[155]刘世平,张洁,饶运清,李培根.基于多代理技术的车间计划与调度研究[J].机械与电子,2001,8(5):28~31
[156]朱灏等[147],杨殿.待料型生产计划与调度优化模型[J] .系统工程,2005,23(12):35~38
[157]徐和平,王德国,孙林岩.多阶段制造系统的生产计划与调度综合模型[J] .兰州理工大学学报,2004,30(3):127~129
[158] Bruker P, Schlie R. Job shop scheduling with multi-purpose machines[J]. Computing.1990,45(2):369~375.