期刊文献+

基于直送的两阶段混合调度模型的模拟退火算法研究 被引量:1

Simulated Annealing Algorithm of Two-stage Hybrid Scheduling Model Based on Through Transport
下载PDF
导出
摘要 研究基于直送的两阶段混合调度模型的模拟退火算法,其目标函数是最小化作业时间。首先,基于问题特征,提出求解该类问题的模拟退火算法;其次,通过数值实验对算法参数进行优化分析,从而给出模拟退火算法的较优参数组合;最后,数值测试进一步表明所给出的优化模拟退火算法的计算有效性。 The paper studies the simulated annealing algorithm of two-stage hybrid scheduling model based on through transport, which the objective function is the minimized operation time. Based on the features of the problem, a simulated annealing algorithm is proposed to solve the problem, then, a numerical experiment is made to optimize the parameters of the algorithm and to select the optimal parameter composition for the algorithm and finally the results of the numerical test proves the effectiveness of the algorithm.
作者 马东彦
出处 《物流技术》 2009年第10期48-50,共3页 Logistics Technology
基金 宁夏高等教育科学研究项目资助
关键词 直送 混合调度 模拟退火 through transport hybrid scheduling simulated annealing
  • 相关文献

参考文献9

  • 1Gupta J N D. A flowshop scheduling problem with two operations per job [J]. International Journal of Production Research, 1997,35 (8) : 2 309-2 325.
  • 2]Bertel S, Billaut J C. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation [J]. European Journal of Operational Research, 2004, (3) : 651-662.
  • 3Agnetis A, Pacifici A, Rossi F, et al. Scheduling of flexible flow lines in an automobile assembly plant [J]. European Journal of Operational Research , 1997,97 : 348-362.
  • 4Piramuthu S, Raman N, Shaw M J. Learning-based scheduling in a flexible manufacturing flow line[J]. IEEE Transactions on Engineering Management, 1994,41 (2): 172-182.
  • 5Brah S A, Hunsucker J L. Branch and bound algorithm for the flow shop with multiple processors [J]. European Journal of Operational Research, 1991, (51):88-99.
  • 6Sriskandarajah C, Sethi S P. Scheduling algorithms for flexible flowshops: Worst and average case performance[J]. European Journalof Operational Research, 1989,43 : 143-160.
  • 7Lee C Y, Vairaktarakis G L. Minimizing makespan in hybrid flowshops [J]. Operations Research Letters, 1994,16 : 149-158.
  • 8Gupta J N D.A flowshop scheduling problem with two operations per job [J]. International Journal of Production Researeh, 1997,35 (8) : 2 309-2 325.
  • 9马东彦.两机器越库调度问题的模拟退火算法[J].物流技术,2008,27(2):67-69. 被引量:4

二级参考文献9

  • 1张和君,张跃.基于模拟退火算法的布局问题研究[J].计算机工程与设计,2006,27(11):1985-1988. 被引量:5
  • 2Kenvin R Gue.Crossdocking ,Just-In-Time for distribution [R]. Teaching Notes-Naval Postgraduate School: Mnterey, CA. 2002.
  • 3Sunderesh S Heragn, Jason C S Huang. A mathematical Model for Warehouse Design and Product Allocation [J]. International Journal of Production Research, 2003.
  • 4Harvey Donaldson, Ellis L Johnson, H Donald Ratliff, Mei Zhang. Schedule-Driven Cross-docking networks [R]. Technical Report, The Logistics Institute, Georgia Institute of Technology, Atlanta, GA. 2003.
  • 5Jozef Grabowski,Jaroslaw Pempera . Some local search algorithms foe no-wait flow-shop problem with makespan criterion [J]. Computer & Operational Research, 2005,(32): 2 197-2 212.
  • 6W Mergenthaler, B Mauersberg, J Feller. Application of the simulated annealing local search technique to problems of redundancy eliminating in functional and parametric test of integrated circuits [J]. Mathematics and Computer in Simulation, 2003, (62): 443-451.
  • 7Jatinder N D Cupta, Karsten Hennig, Frank Werner. local search heuristic for two-stage flow shop problem with secondary criterion [J]. Computer&Operational Research, 2002,(29): 123-149.
  • 8马东彦,陈峰.以总加权完工时间为目标的两台机越库排序的动态规划算法[J].上海交通大学学报,2007,41(5):852-856. 被引量:17
  • 9徐天亮,罗上远.随机需求直通配送系统中横向转载的期望费用方法[J].工业工程与管理,2004,9(1):27-31. 被引量:13

共引文献3

同被引文献6

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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