| 装配系统的供应链排序问题 |
| |
| 引用本文： | 陈荣军,唐国春. 装配系统的供应链排序问题[J]. 数学的实践与认识, 2011, 41(18) |
| |
| 作者姓名： | 陈荣军 唐国春 |
| |
| 作者单位： | 1. 常州工学院数学系,江苏常州213002;常州市软件技术研究与应用重点实验室,江苏常州213002
2. 上海第二工业大学管理工程研究所,上海,201209 |
| |
| 基金项目： | 国家自然科学基金重大国际(地区)合作研究项目(20710015); 江苏省教育厅项目(yw06037)和江苏省”青蓝”工程资助 |
| |
| 摘 要： | 在装配系统中,有多个供应商向同一个制造商提供零部件,仅当一个产品的所有零部件都送到后,制造商才进行最后的组装与发送.假设制造商为非瓶颈式生产.研究目标为工件带权完工时间和及最大延误的装配系统供应链排序问题,利用排序的理论和方法,分别设计多项式时间算法,并分析算法的性能比.
|
| 关 键 词： | 排序 供应链 装配系统 多项式时间算法 |
Supply Chain Scheduling in Assembly Systems |
| |
| CHEN Rong-jun,TANG Guo-chun. Supply Chain Scheduling in Assembly Systems[J]. Mathematics in Practice and Theory, 2011, 41(18) |
| |
| Authors: | CHEN Rong-jun TANG Guo-chun |
| |
| Affiliation: | CHEN Rong-jun~(1,2),TANG Guo-chun~3 (1.Department of Maththematics,Changzhou Institute of Technology,Jiangsu 213002,China) (2.Changzhou Key Lab of Software Technology and Applications,China) (3.Institute of Management Engineering,Shanghai Second Polytechnic University,Shanghai 201209,China) |
| |
| Abstract: | We study supply chain scheduling in assembly system where suppliers provide parts to a manufacturer.A product cannot be assembled and delivered until all its parts have been supplied.The manufacturer performs nonbottleneck operations for each product.Two classical scheduling objectives are considered:minimization of the total weighted completion time and of the maximum tardness.Using the theories and methodologies of scheduling,we propose polynomial algorithms with worst-case performance analysis for each p... |
| |
| Keywords: | scheduling supply chain assembly systems polynomial algorithms |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
