| 多机器总完成时间和makespan近似最优的开放式车间调度方法 |
| |
| 引用本文： | 韩 兵,席裕庚. 多机器总完成时间和makespan近似最优的开放式车间调度方法[J]. 控制理论与应用, 2003, 20(6): 859-864 |
| |
| 作者姓名： | 韩 兵 席裕庚 |
| |
| 作者单位： | 上海交通大学,自动化系,上海,200030 |
| |
| 基金项目： | 国家863计划项目(9845-006). |
| |
| 摘 要： | 研究了多机器开放式车间调度问题,采用离散事件系统调度使makespan最小化和总完成时间最小.给出了在确定处理机器的条件下,不同批次的作业总完成时间最优的排序定理,以及选择机器处理作业的指标优化定理,利用给出的若干定理建立了总完成时间最优的调度方法.作者利用加权总完成时间最优算法来近似求解makespan最小化和总完成时间最优的调度问题.作者也利用论文的理论结果给出了一个三机器开放式车间情况的实际算例.
|
| 关 键 词： | 开放式车间 离散事件系统 加权总完成时间 近似最优调度 |
| 文章编号： | 1000-8152(2003)06-0859-06 |
| 收稿时间： | 2001-02-05 |
| 修稿时间： | 2001-02-05 |
Schedule methodology of approximate optimal cost of total time and makespan for multi-machines in open shop |
| |
| HAN Bing and XI Yu-geng. Schedule methodology of approximate optimal cost of total time and makespan for multi-machines in open shop[J]. Control Theory & Applications, 2003, 20(6): 859-864 |
| |
| Authors: | HAN Bing and XI Yu-geng |
| |
| Affiliation: | Department of Automation, Shanghai Jiao Tong University, Shaihai 200030,China;Department of Automation, Shanghai Jiao Tong University, Shaihai 200030,China |
| |
| Abstract: | 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. |
| |
| Keywords: | open shop discrete event system weight total time approximate optimal schedule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《控制理论与应用》浏览原始摘要信息 |
|
点击此处可从《控制理论与应用》下载全文 |
