| 由两台柔性机器组成的流水作业问题 |
| |
| 引用本文： | 王景侠,孙世杰. 由两台柔性机器组成的流水作业问题[J]. 上海大学学报(自然科学版), 2001, 7(3): 218-220 |
| |
| 作者姓名： | 王景侠 孙世杰 |
| |
| 作者单位： | 上海大学理学院, |
| |
| 基金项目： | 国家自然科学基金(19771057)资助项目 |
| |
| 摘 要： | 研究了由两台柔性机器所组成的流水作业问题，其中有n个相同工件，每一工件需先在机器1上完成所需时间为p1的第一次加工，然后城单独在机器1上或单儿在机器2上完成所需时间分别为P12，P21的第二次加工，最后在机器2上完成所需时间为P2的第三次加工，要求适当安排这n个工件的加工方式和次序以使加工全程（Cmax)最小，本文对此 给出了分析解。
|
| 关 键 词： | 排序 柔性机理 加工全程 流水作业问题 加工方式 加工次序 最优序 |
| 文章编号： | 1007-2861(2001)03-0218-03 |
| 修稿时间： | 2000-03-07 |
Scheduling Problems in a Flowshop Composed of Two Flexible Machines |
| |
| WANG Jing xia,SUN Shi jie. Scheduling Problems in a Flowshop Composed of Two Flexible Machines[J]. Journal of Shanghai University(Natural Science), 2001, 7(3): 218-220 |
| |
| Authors: | WANG Jing xia SUN Shi jie |
| |
| Abstract: | This paper studies the scheduling problems in a flowshop composed of two flexible machines, in which there are n identical jobs, each of which needs to be processed first on machine 1 with a processing time p 1 , then either processed separately on machine 1 with a processing time p 12 or on machine 2 with a processing time p 21 , and finally processed on machine 2 with a processing time p 2 . Our purpose is to properly schedule the processing mode and the sequence in order to minimize the makespan.In this paper we give the analytic solution to this problem. |
| |
| Keywords: | scheduling flexible machine makespan |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
