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

为解决产品种类多、中小批量的多目标柔性作业车间调度问题,提出了一种基于等量分批方法的多目标柔性分批启发式调度算法。考虑了实际生产中的班次作息时间等约束,采用FIFS与EDD、SPT及OSPT策略相结合的多种分派规则,使得算法在优先调度空闲机床的情况下,根据不同的分派策略得出短批次优先、短订单优先、交货时间优先的三种调度结果,决策者可根据三种调度结果的性能选择最适合的调度方案。实例计算结果表明,该算法是高效、可行的。

A scheduling algorithm to equal amount of batches for Job Shop considering the constraint of work-shifts

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 was proposed. The algorithm, which considered the constraint of work-shifts in factory, could obtain three scheduling results 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 performance of the three kinds of scheduling results. Finally, An example showed that the algorithm was efficient and feasible.