| 产品中各工件在单台机器上加工时的排序问题 |
| |
| 引用本文： | 陈寒冰,孙世杰. 产品中各工件在单台机器上加工时的排序问题[J]. 上海大学学报(自然科学版), 1998, 0(2) |
| |
| 作者姓名： | 陈寒冰 孙世杰 |
| |
| 作者单位： | School of Sciences，Shanghai University |
| |
| 摘 要： | 本文考虑的是工件在单台机器上加工随后组装成产品的排序问题．每个产品由一个特殊工件和一个共同工件组成，机器从加工特殊工件转到加工共同工件有一个调整时间，目标是使所有产品完工时间在批可达或工件可达情况下的加权和最小．对两种情况我们都给出了多项式时间算法．
|
| 关 键 词： | 排序；算法；产品问题 |
The Scheduling Problem in Manufacturing Components at a Single Facility |
| |
| Chen Hanbing Sun Shijie. The Scheduling Problem in Manufacturing Components at a Single Facility[J]. Journal of Shanghai University(Natural Science), 1998, 0(2) |
| |
| Authors: | Chen Hanbing Sun Shijie |
| |
| Abstract: | This paper deals with the problem of scheduling the manufacture of components at a single facility for subsequent assembly into end products. Each product is composed of a unique component and a common component. Switching from unique components to common components needs a set up time.The objectives are to minimize the total weighted completion time under the case of either the batch availability or the item availability. The polynomial algorithm are given for both the cases. |
| |
| Keywords: | sequencing algrithm product problem |
| 本文献已被 CNKI 等数据库收录！ |
