考虑班次约束的Job Shop等量分批调度算法  

A Scheduling Algorithm to Equal Amount of Batches for Job Shop Considering the Constraint of Work-shifts

作　　者：黄瑜岳[1] 李克清[1] 郑晓峰 

机构地区：[1]常熟理工学院计算机科学与工程学院,常熟215500 [2]江苏网路神公司,常熟215500

出　　处：《科学技术与工程》2013年第1期1-7,16,共8页Science Technology and Engineering

基　　金：江苏省科技计划项目(BE2011376);常熟市工业攻关重点项目(CG201003)资助

摘　　要：为解决产品种类多、中小批量的多目标柔性作业车间调度问题,提出了一种基于等量分批方法的多目标柔性分批启发式调度算法。考虑了实际生产中的班次作息时间等约束,采用FIFS与EDD、SPT及OSPT策略相结合的多种分派规则,使得算法在优先调度空闲机床的情况下,根据不同的分派策略得出短批次优先、短订单优先、交货时间优先的三种调度结果,决策者可根据三种调度结果的性能选择最适合的调度方案。实例计算结果表明,该算法是高效、可行的。To solve the problem of multi-objective flexible job shop scheduling with many varieties and large amount of products, a novel multi-object heuristic scheduling algorithm base on equal amount of batches is pro- posed. The algorithm, which considered the constraint of work-shifts in factory, could obtain three scheduling re- sults by using EDD, SPT and OSPT batch selecting strategy in the condition of machine selecting strategy using FIFS. As a result, the decision maker could choose the most appropriate scheduling solution according to the perform- ance of the three kinds of scheduling results. Finally, An example showed that the algorithm is efficient and feasible.

关 键 词：作业车间调度 多目标优化 等量分批 班次约束 

分 类 号：O221.6[理学—运筹学与控制论]