期刊文献+

常规混合流水车间调度问题的等价变换

Equivalent transformation of standard hybrid flow shop scheduling problem
下载PDF
导出
摘要 常规混合流水车间调度问题具有多阶段、同速平行机、总完工时间最小化等特征,它是研究混合流水车间调度问题最为自然的起点。对于此类NP难问题的基本性质的研究还不够充分,其算法设计缺乏系统的理论知识指导。因此,针对常规混合流水车间调度问题的性质展开研究,探讨了调度问题的可逆性特征,并在此基础上分析了基于逆序变换进行问题求解的可行性,为算法设计提供了理论依据。
出处 《制造业自动化》 2015年第18期45-47,56,共4页 Manufacturing Automation
基金 国家自然科学基金面上项目(71371162) 福建省自然科学基金(2014J01271) 厦门理工学院高层次人才项目(YSK10009R)
  • 相关文献

参考文献11

  • 1Gupta J N D.Two-stage hybrid flowshop scheduling problem [J]. Journal of the Operational Research Society, 1988, 39(4):359-364.
  • 2Carlier J, Nrron E.An exact method for solving the multi- processor flow-shop [J].RAIRO - Operations Research,2000, 34(1):1-25.
  • 3Nrron E, Baptiste P, Gupta J N D.Solving hybrid flow shop problem using energetic reasoning and global operations[J]. Omega-International Journal of Management Science,2001, 29(6): 501-511.
  • 4Guinet A,Solomon M. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time[J].International Journal of Production Research,1996,34(6):1643-1654.
  • 5屈国强.瓶颈指向的启发式算法求解混合流水车间调度问题[J].信息与控制,2012,41(4):514-521. 被引量:14
  • 6Nowicki E,Smutnicki C.The flow shop with parallel machines: A tabu search approach[J].European Journal of Operational Research, 1998,106(2-3):226-253.
  • 7Pan Q K, Wang L, Li J Q, etc.A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimization[J].Omega-International Journal of Management Science,2014,45:42-56.
  • 8Chung T P, Liao C J. An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem[J].Applied Soft Computing,2013,13(8):3729-3736.
  • 9Li J Q,Pan Q K,Wang F T.A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem[J].Applied Soft Computing,2014,24:63-77.
  • 10Cui Z,Gu X S.An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems[J]. Neurocomputing,2015,148(1):248-259.

二级参考文献25

  • 1李黎,成晔,袁守华.基于瓶颈分析的优先权调度算法研究[J].计算机集成制造系统,2005,11(2):247-250. 被引量:11
  • 2左燕,谷寒雨,席裕庚.大规模流水线调度的瓶颈分解算法研究[J].控制与决策,2006,21(4):425-429. 被引量:10
  • 3Linn R, Zhang W. Hybrid flow shop scheduling: A survey[J] Computer & Industrial Engineering, 1999, 37(1/2): 57-61.
  • 4Kis T, Pesch E. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem[J]. European Journal of Operational Research, 2005, 164(3): 592-608.
  • 5Quadt D, Kuhn H. A taxonomy of flexible flow line schedul- ing procedures[J]. European Journal of Operational Research, 2007, 178(3): 686-698.
  • 6Ruiz R, Antoonio J, Rodriguez V. The hybrid flow shop schedul- ing problem[J]. European Journal of Operational Research, 2009, 5(1): 1-18.
  • 7Ribas I, Listen R, Framinan J M. Review and classification of hybrid flow shop scheduling problems from a production sys- tem and a solutions procedure perspective[J]. Computer & Op- erations Research, 2010, 37(8): 1439-1454.
  • 8Nawaz M, Enscore E, Ham I. A heuristic algorithm for the m- machine, n-job flow shop sequencing problem[J]. Omega, 1983, 11(1): 91-95.
  • 9Palmer D S. Sequencing jobs through a multi-stage process in the minimum total time - A quick method of obtaining a near optimum[J]. Operations Research Quarterly, 1965, 16(1): 101- 107.
  • 10Campbell H G, Dudek R A, Smith M L. A heuristic algorithm for the n job, m machine sequencing problem[J]. Management Science, 1970, 16(10): B-630-B-637.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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