期刊文献+

有模具约束的平行机台最小拖期和调度问题 被引量:2

Minimize total tardiness of the parallel machine with modulo constrain
下载PDF
导出
摘要 针对某电器企业的一个瓶颈工序来制定调度方案,该问题归纳为平行机台具有模具约束,目标为最小拖期和的调度问题.本文提出了如下的启发式算法:根据模具情况运用成组技术对工作成组并生成运行表:按运行表顺序对各个运行中的工作进行指派机台,设置禁忌模具集合,避免对运行的短视性;根据工作的交货期和加工时间选择适当的机台进行加工;在各个机台运用NBR(NetBenefitofRelocation)算法调节顺序以减少拖期和.该算法在厂家的实际测试中,通过三个不同的实例与手工排程进行了比较,各项指标均有明显优势. This paper develops a scheduling method for a bottleneck course of an electrical enterprise, it is a problem that minimizes the total tardiness of jobs processing in parallel machine with modulo constrains. A heuristic algorithm is developed. Firstly, we employ group technology by grouping jobs under modulo constrains to produce run list. Secondly, when assign each job of the run to the machine, under a taboo list of modulo that is set to avoid myopic modulo,we assign each job by its due date and processing times. Finally, after all jobs were assigned, we employ NBR (net benefit of relocation)algorithm to adjust the sequence of jobs on each machine for minimizing total tardiness. Compared with scheduling by manual, the heuristic algorithm has high speed and excellent efficiency.
出处 《系统工程学报》 CSCD 1999年第4期345-350,共6页 Journal of Systems Engineering
基金 国家自然科学基金 灿坤电器实业股份有限公司资助
关键词 成组技术 调度问题 启发式算法 平行机台 gruop technology scheduling problem heuristic algorithm parallel machine
  • 相关文献

同被引文献22

  • 1梁旭,黄明,常征.求解车间调度问题的一种新遗传退火混合策略[J].计算机集成制造系统,2005,11(6):851-854. 被引量:21
  • 2周亚勤,李蓓智,杨建国.考虑批量和辅助时间等生产工况的智能调度方法[J].机械工程学报,2006,42(1):52-56. 被引量:20
  • 3袁坤,朱剑英.一种求解多目标柔性Job Shop调度的改进遗传算法[J].中国机械工程,2007,18(2):156-160. 被引量:24
  • 4张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 5PFUND M W, FOWLER J W,GADKARI A, et al. Schedu- ling jobs on parallel machines with setup times and ready times[J]. Computers & Industrial Engineering, 2008, 54 ( 4 ) : 764-782.
  • 6LIN B M T, JENG A A K. Parallel machine batch scheduling to minimize the maximum lateness and the number of tardy Jobs[J]. International Journal of Production Economics, 2004, 91(2): 121-134.
  • 7YUAN J J, LIU Z H, NG C T, et al. The unbounded single machine parallel batch scheduling problem with family Jobs and release dates to minimize makespan[J]. Theoretical Com- puter Science,2004,320(2/3) : 199-212.
  • 8SCHUTTEN J M J, LEUSSINK R A M. Parallel machine scheduling with release dates, due dates and family setup times [J]. International Journal of Production Economics, 1996,46/ 47(1) : 119-125.
  • 9LEE I, SIKORA R, SHAW M J. A genetic algorithm based approach to flexsible flow-line scheduling with variable lot si- zes[J]. IEEE Transacions on Systems, Man, and Cybernet- ics-Part B: Cybernetics, 1997,27 ( 1 ) : 36-53.
  • 10DREXL A, KIMMS A. Lot sizing and scheduling--survey and extensions[J]. European Journal of Operational Research, 1997,99(2) :221-235.

引证文献2

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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