摘要
研究了多机器开放式车间调度问题,采用离散事件系统调度使makespan最小化和总完成时间最小.给出了在确定处理机器的条件下,不同批次的作业总完成时间最优的排序定理,以及选择机器处理作业的指标优化定理,利用给出的若干定理建立了总完成时间最优的调度方法.作者利用加权总完成时间最优算法来近似求解makespan最小化和总完成时间最优的调度问题.作者也利用论文的理论结果给出了一个三机器开放式车间情况的实际算例.
The schedule for multi-machines of open shop was investigated. The model of open shop schedule was described by the discrete event dynamic system. As a result, the theorem of sequencing jobs of the different batches in the condition of a certain machine for total time optimum, and the theorem of choosing the processing machine for a certain job among machines at minimum cost were derived. Based on these theorems, the methodology of open shop schedule was built in the approximate optimum of the total time. The optimal cost of weighted total time approximating the optimal cost of total time and makespan was proposed. The example of optimal schedule was presented for three machines of open shop.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
2003年第6期859-864,共6页
Control Theory & Applications
基金
国家863计划项目(9845-006).
