期刊文献+

具有成组约束的柔性同序加工车间的排序算法 被引量:2

Algorithm for Scheduling Flexible Flow Shop with Group Constraints
下载PDF
导出
摘要 针对轮胎模具的生产调度特点,研究了具有成组约束的两阶段柔性同序加工车间(FF2)的调度问题,建立了目标函数为最小化最大完成时间的调度数学模型,基于Johnson准则提出一种新的启发式算法,并应用企业的实际算例,说明了数学模型和求解方法的可靠性和有效性。 Tire mold production is characterized as flow shop with group constraints.In this paper,the scheduling problem of two-stage flexible flow shop for tire mold production is addressed.A mathematical model is put forward for the problem with makespan as objective.Based on Johnson polynomial algorithm,a new heuristic is presented to solve the problem.The reliability and effectiveness of the new algorithm is demonstrated by an example from the industrial practice.
出处 《工业工程》 北大核心 2011年第2期112-117,共6页 Industrial Engineering Journal
基金 国家自然科学基金资助项目(50675039) 国家863计划CIMS资助项目(2006AA04Z132) 广东省自然科学基金团队资助项目(05200197) 广东省科技攻关资助项目(2004B10201030)
关键词 模具 柔性流水车间 成组调度 启发式算法 mould manufacturing flexible flow shop group scheduling heuristic
  • 相关文献

参考文献10

  • 1Johnson. Optimal tow-and-three-stage production schedules with setup times included[ J] , Naval Res Logist Quart, 1954 (1) :61-68.
  • 2Gupta J N D. Two-stage Hybrid Flow shop scheduling prob- lem[J]. Journal of Operational Research Society, 1988,39 (4) :359-364.
  • 3Sriskandarajah C, Sethi S P, Scheduling algorithm for flexible flow shops:Worst and average case performance [ J ]. Euro- pean Journal of Operational Research, 1989,43 : 143-160.
  • 4Lee C Y,Vairaktarakis G L,Minimizing makespan in hybrid flow shops[ J]. Operations Research Letters, 1994,16 : 149-158.
  • 5Osman I H, Potts C N. Simulated Annealing for Permutation Flow-Shop Scheduling[ J ]. Omega ( Oxford ), 1989,17 ( 6 ) : 551-557.
  • 6Moccellin J V. A new heuristic method for the permutation flow shop scheduling problem [ J ]. The Journal of the Opera- tional Research Society,1995,46(7) :883-886.
  • 7Logendran R, Carson S, Hanson E. Group scheduling in flexi- ble Flow shops [ J ]. Inter-national Journal of Production Eco- nomics, 2005,95 : 143-155.
  • 8Logendran R, DeSzoeke P, Barnard F. Sequence-dependent group scheduling problems in flexible flow shops [ J ]. Inter- national Journal of Production Economics ,2006,102:66-86.
  • 9Zandieh M, Dorri B, Khamseh A R. Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops [ J ]. Inter-national Journal of ad- vanced manufacturing technology,2009,43:7-$.
  • 10孙昊胜.考虑后工序带有成组特征的模具电极调度策略的研究[D].广州:广东工业大学,2007.

同被引文献23

  • 1何桢,齐二石,王恒毅,韩尚梅.成组流水线上零件排序的优化算法[J].管理工程学报,1996,10(4):243-248. 被引量:7
  • 2周延佑,陈长年.多品种、单件、小批量生产和少品种、大批量生产解决方案的新发展——IMTS 2006观后感之二[J].制造技术与机床,2007(5):28-36. 被引量:12
  • 3Slowinski R,Hapke M.Scheduling under fuzziness[M].NewYork:Physica-Verlag.2000.
  • 4J.Peng,B.Liu,Parallel machine scheduling models with fuzzyprocessing times[J].Information Sciences,166,49-66,2004.
  • 5PAN Q K, TASGETIREN M F, SUGANTHAN P N, el al. A discrete artificial bee colony algorithm for the lot streaming flow shop scheduling problem[J]. Information Sciences,2011, 181 ( 12), 2455-2468.
  • 6PANWALKAR S S, KOULAMAS C. The three-stage order- ed flow shop problem with flexible stage ordering[J]. Comput- ers & Industrial Engineering,2013,64(4) :1093-1095.
  • 7MARICHELVAM M K, PRABAHARAN T, YANG X S. Improved cuckoo search algorilhm for hybrid flow shop sched- uling problems to minimize makespan[J]. Applied Soft Com- puting,2014,19(6):94- 101.
  • 8SALMASI N, LOGENDRAN R, SKANDARI M R. Total fl- ow time minimization in a flowshop sequence dependent group scheduling problem[J]. Computers & Operations Research, 2010,37(1) : 199-212.
  • 9HAJINEJAD D, SALMASI N, MOKHTAR1 R. A fast hy brid particle swarm optimization algorithm for flow shop se- quence dependent group scheduling problem[J]. Scientia Iran- ica,2011,18(3) :759 -764.
  • 10YE T F. Analysis on multi-stage lot streaming: the effect of transfer[J]. Computers & Industrial Engineering, 2012, 62 (4) : 1046-1054.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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