双资源JSP动态分类调度研究

针对作业车间的加工受到机床、操作工人等双资源制约条件下出现多种扰动的JSP调度问题,提出了基于不同的扰动进行分类处理的新方法。该方法以最小化最大完工时间为目标,首先基于机床故障修复时间、工人离岗时间及取消订单包含任务的多少进行分类调度,然后根据机床故障修复后以及工人回岗后剩余任务的多少决定是否进行再一次的调度。采用遗传算法和模拟退火算法相结合的算法获得调度方案,并进行分析和比较。

Dynamic Classified JSP Scheduling of Dual-resource

A new classified scheduling method was proposed to the job-shop scheduling problem (JSP) with multiple disturbances constrained by machines and workers. Function objective of the proposed method was to minimize the completion time. Firstly, the scheduling was classified based on machine repairing time, and worker leaving time, and task of order canceling;and then it was decided whether it was arranged again based on remainder task after machine repairing and worker returning. The scheduling results were obtained based on hybrid algorithm of genetic algorithm and simulated annealing algorithm (GASA). Scheduling examples were employed to illustrate the effectiveness of the method.