期刊文献+

求解作业车间提前/拖期调度问题的一种新解码方法 被引量:9

Novel decoding method for Job Shop earliness and tardiness scheduling problem
在线阅读 下载PDF
导出
摘要 针对带有非正规性能指标的作业车间提前/拖期调度问题,基于工序编码方式,设计了一种适用于粒子、染色体等个体的三阶段解码方法。通过半主动解码操作,以增加初始调度解的搜索范围;采用插入式贪婪解码这类主动调度方法,以减少拖期零件子集的拖期惩罚成本。运用逆向主动解码操作来延迟所有零件的释放期,并在保证拖期零件完工时间不变的前提下进一步压缩提前惩罚成本。这种三层递阶解码方法有助于大幅度压缩提前/拖期惩罚总成本。将该解码方法应用于粒子群算法中的粒子解码过程,并通过粒子位置更新操作来实现调度解的迭代优化。通过120个随机调度算例的仿真实验,证明了该方法的有效性。 Aiming at the Job Shop earliness and tardiness scheduling problem with informal performance index,a new decoding method with three hierarchical structure applied to particle and chromosome was designed based on procedure code pattern.A semi-active decoding operation was employed to extend the search band of initial scheduling solution.The active scheduling method of insert greedy decoding was used for the tardy jobs to reduce the tardiness cost of jobs.The active decoding operator with reversal mechanism was operated to delay the due date of all parts,and the premature punishment cost was reduced further on the premise of tardy jobs' completion time unchanged.Thus,the total tardiness and earliness costs could be cut down owing to these three successive decoding procedures.This method was applied to particle decoding in Particle Swarm Optimization(PSO),and the iterative optimization of scheduling solution was realized by updating the particle position.The effectiveness of the method was improved by simulation result of 120 random scheduling examples.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2011年第12期2652-2659,共8页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(50705076 51075337)~~
关键词 作业车间调度 提前/拖期惩罚 不同交货期 解码 粒子群算法 Job Shop scheduling earliness/tardiness punishment distinct due date decoding particle swarm optimization
  • 相关文献

参考文献13

  • 1BAKER K R, SCUDDER G D. Sequencing with earliness and tardiness penalties:a review[J]. Operations Research,1990,38 (1) : 22-36.
  • 2BECK J C, REFALO P. Combining local search and linear programming to solve earliness/tardiness scheduling problems [C]//Proceedings of the 4th International Workshop on Inte- gration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems. Le Croisic, France: CP-AI-OR'02,2002: 221-235.
  • 3BECK J C, REFALO P. A hybrid approach to scheduling with earliness and tardiness costs [J]. Annals of Operations Research,2003,118(1/2/3/4):49-71.
  • 4DANNA E, PERRON I.. Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness eosts[J]. Lecture Notes in Computer Science, 2003,2833 : 817-821.
  • 5DANNA E, ROTHBERG E, PAPE C L. Integrating mixed integer programming and local search: a case study on job-shop scheduling problems[C]//DOI.. 10. 1.1. 111. 5253. pdf.
  • 6BAPTISTEA P, FLAMINI M, SOURD F. Lagrangian boun- ds for just-in-time Job-Shop scheduling[J]. Computers& Operations Research, 2008,35 (3) : 906-915.
  • 7张超勇,管在林,刘琼,邵新宇,李培根.一种新调度类型及其在作业车间调度中的应用[J].机械工程学报,2008,44(10):24-31. 被引量:25
  • 8PAN Q K, TASC-ETIREN M F, LIANG Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem[J]. Computers & Operations Research, 2008,35 (9) : 2807-2839.
  • 9FOGEL D B. A parallel processing approach to a multiple traveling salesman problem using evolutionary programming [C]//Proceedings of the 4th Annual Parallel Processing Sym- posium. Washington, D. C. , USA: IEEE Computer Society, 1990:318-326.
  • 10DAVIS L. Applying adaptive algorithms to epistatic domains [C]//Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, Cal. , USA; Morgan Kaufmann, 1985 : 162-164.

二级参考文献27

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:130
  • 2Blazewicz J, Domschke W, Pesch E. The Job Shop Scheduling Problem: Conventional and New Solution Techniques. European Journal of Operational Research, 1996, 93(1):1~33
  • 3Jain A S, Meeran S. Deterministic Job-Shop Scheduling:Past,Present and Future. European Journal of Operational Research. 1999,113(2): 390~434
  • 4Carlier J, Pinson F. An Algorithm for Solving the Job-Shop Problem. Management Science, 1989,35(2): 164~176
  • 5Laarhoven P V, Aarts E, Lenstra J K. Job Shop Scheduling by Simulated Annealing. Operations Research, 1992,40(1): 113~125
  • 6Nowicki E, Smutnicki C. A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science, 1996, 42(6): 797~813
  • 7Rodammer F A, White K P. A Recent Survey of Production Scheduling. IEEE Trans.SMC, 1988,18(6): 841~851
  • 8王凌. 智能优化算法及其应用. 北京:清华大学出版社, 2001
  • 9Holland J H. Adaptation in Nartural and Artifical System. Massachusett: MIT Press, 1975
  • 10Davis L. Job Shop Scheduling with Genetic Algorithms.International Conference on Genetic Algorithms and Their Application, Hillsdale, 1985

共引文献147

同被引文献155

  • 1王常青,操云甫,戴国忠.用双向收敛蚁群算法解作业车间调度问题[J].计算机集成制造系统,2004,10(7):820-824. 被引量:31
  • 2高亮,高海兵,周驰.基于粒子群优化的开放式车间调度[J].机械工程学报,2006,42(2):129-134. 被引量:17
  • 3潘全科,王文宏,朱剑英.一类解决车间调度问题的遗传退火算法[J].机械科学与技术,2006,25(3):317-321. 被引量:6
  • 4张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:106
  • 5姚嫣菲.基于改进遗传算法的车间作业调度问题研究[D].杭州:浙江大学,2011.
  • 6Gu J W, Gu M Z, Cao CW, Gu XS. A Novel Competitive Co-Evolutionary Quantum Genetic Algorithm for Stochastic Job Shop Scheduling Problem [ J ]. Computers and Operations Research, 2010, 37 ( 5 ) : 927-937.
  • 7Horng S C, Lin SY. Multi-Stage Ordinal Optimization Based Approach for Job Shop Scheduling Problems [ J ]. Applied Mathe- matics and Computation, 2012, 219 (3) : 1125-1134.
  • 8Cowling P, Johansson M. Using Real Time Information for Effective Dynamic Scheduling. European Journal of Operational Re- search, 2002, 139(2): 230-244.
  • 9Smith S. Reactive Scheduling Systems ff Intelligent Scheduling Systems [ M ]. Brown D and Seherer W, Boston, Kluwer Press, 1995.
  • 10Zhang R, Song S J, Wu C. A Two-Stage Hybrid Particle Swarm Optimization Algorithm for the Stochastic Job Shop Scheduling Problem [ J ]. Knowledge-Based Systems, 2012, 27 ( 3 ) : 393-406.

引证文献9

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部