期刊文献+

考虑多约束的混合流水车间MOJ调度 被引量:4

Scheduling multiple orders per job with various constraints for hybrid flow shop
原文传递
导出
摘要 考虑晶圆加工过程中的多品种和与次序相关的换模时间约束,以系统总完工时间最小为优化目标,建立混合流水车间MOJ调度模型.在此基础上,提出了基于作业-产品-机器三层析取网络流的列生成算法.为进一步改善列生成算法存在的尾效应,将基于次梯度优化的拉格朗日松弛算法嵌入列生成算法框架中,构建了采用双重迭代的改进型列生成(MCG)算法.最后,通过理论分析和仿真实验表明了MCG算法是有效、可行的. With a comprehensive consideration of multiple product types and sequence-dependent setup times constraints in which processes of wafer fabrications, a scheduling model of multiple orders per job(MOJ) in a hybrid flow shop with an objective function of minimizing total completion time of the system is developed. On the basis of the descriptions, a column generation algorithm based on the job-product-machine three level disjunctive network flow is proposed. Furthermore, to improve the degradation effects of column generation algorithm, Lagrangian relaxation with sub-gradient optimization is combined into the frame of column generation algorithm, and then a modified column generation(MCG) algorithm adopting dual iteration is proposed. Finally, theory analysis and simulation experiments show that the developed MCG algorithm is valid and feasible.
作者 周炳海 王腾
出处 《控制与决策》 EI CSCD 北大核心 2016年第5期776-782,共7页 Control and Decision
基金 国家自然科学基金项目(61273035 71471135)
关键词 多品种 换模时间 析取网络流 改进型列生成 multiple product types setup times disjunctive network flow modified column generation
  • 相关文献

参考文献13

  • 1Monch L, Fowler J W, Dauzere-Peres S, et al. A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations[J]. J of Scheduling, 2011, 14(6): 583-599.
  • 2Qu P, Mason S J. Using tabu search on the single machine multi-orders per job scheduling problem[C]. IIE Annual Conf and Exhibition 2004. Houston: Institute of Industrial Engineers, 2004: 1831-1835.
  • 3Qu P, Mason S J. Metaheuristic scheduling of 300 mm jobs containing multiple orders[J]. IEEE Trans on Semiconductor Manufacturing, 2005, 18(4): 633-643.
  • 4Sobeyko O, Monch L. Genetic algorithms to solve a single machine multiple orders per job scheduling problem[C]. 2010 Winter Simulation Conference. Piscataway: IEEE, 2010: 2493-2503.
  • 5Sarin S C, Wang L, Cheng M. A single-machine, singlewafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times[J]. Computers & Operations Research, 2012, 39(7): 1411-1418.
  • 6Mason S J, Chen J S. Scheduling multiple orders per job in a single machine to minimize total completion time[J]. European J of Operational Research, 2010, 207(1): 70-77.
  • 7Jampani J, Mason S J. Column generation heuristics for multiple machine, multiple orders per job scheduling problems[J]. Annals of Operations Research 2008, 159(1): 261-273.
  • 8Laub J D, Fowler J W, Keha A B. Minimizing makespan with multiple-orders-per-job in a two-machine flowshop[J]. European J of Operational Research, 2007, 182(1): 63-79.
  • 9Sarin S C, Wang L, Cheng M. Minimising makespan for a two-machine, flow shop, single-wafer-processing, multiple-jobs-per-carrier scheduling problem[J]. Int J of Planning and Scheduling, 2012, 1(3): 171-208.
  • 10Jia J, Mason S J. Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines[J]. Int J of Production Research, 2009, 47(10): 2565-2585.

二级参考文献18

  • 1Hoogeveen J A, Velde S L. Earliness-tardiness schedulingaround almost equal due dates [J]. Informs J on Computing,1997,9(1): 92-99.
  • 2De P, Ghosh J B, Wells C E. Due-dates assignment andearly/tardy scheduling on identical parallel machines[J].Naval Research Logistics, 1994, 41(1): 17-32.
  • 3Cheng T C E, Chen Z L. Parallel-machine schedulingproblems with earliness and tardiness penalties [J]. J ofOperational Research Society, 1994,45(6): 685-695.
  • 4Arkin E M, Silverberg E B. Scheduling jobs with fixed startand end times [J]. Discrete Applied Mathematics, 1987,18(1): 1-8.
  • 5Bouzina K I,Emmons H. Interval scheduling on identicalmachines[J]. J Global Optimization, 1996,9(3/4): 379-393.
  • 6Bruno J, Coffman E G,Sethi R. Scheduling independenttasks to reduce mean finishing time[J]. Communications ofthe ACM, 1974, 17(7): 382-387.
  • 7Bar-Noy A, Guha S,Naor J S, et al. Approximating thethroughput of multiple machines in real-timescheduling[J]. SIAM J on Computing, 2001; 31(2): 331-352.
  • 8Sivrikaya F, Ulusoy G. Parallel machine schedulingwith earliness and tardiness penalties[J]. Computers &Operations Research, 1999,26(8): 773-787.
  • 9Kaplan S, Rabadi G. Exact and heuristic algorithms forthe aerial refueling parallel machine scheduling problemwith due date-to-deadline window and ready times[J].Computers & Industrial Engineering, 2012, 62(1): 276-285.
  • 10Akker J M,Hoogeveen J A,Velde S L. Parallel machinescheduling by column generation[J]. Operations Research,1999,47(6): 862-872.

共引文献6

同被引文献43

引证文献4

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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