Coordination strategy for production planning in supply chain based on Lagrange relaxation algorithm
文献类型：会议论文
| 作者 | Zhang CH(张翠华); Chang GS(常广庶); Fan Y(范岩); Yu HB(于海斌)
|
| 出版日期 | 2006 |
| 会议名称 | IEEE Asia-Pacific Services Computing Conference (APSCC 2006) |
| 会议日期 | December 12-15, 2006 |
| 会议地点 | Guangzhou, China |
| 关键词 | supply chain coordination distributed decision-making production planning Lagrange relaxation algorithm |
| 页码 | 613-616 |
| 通讯作者 | 张翠华 |
| 中文摘要 | To solve the coordination problem of multienterprises supply chain production planning, a coordination and optimization strategy of distributed decision-making based on Lagrange relaxation algorithm is presented. By relaxing the material flow balance constraints among enterprises with the internal price, i.e. Lagrange multipliers, the whole supply chain production planning problem is decomposed into multiple single enterprise production planning sub problems, each of which can make its own production plan through local information. Through iterative update of the internal price for each kind of products provided by enterprises, the supply chain could be coordinated and the nearest optimal solution can be achieved. The simulation experiments show that the method can better solve the multienterprise supply chain production planning problem. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | IEEE Comp Soc, S China Univ Technol |
| 会议录 | APSCC: 2006 IEEE Asia-Pacific Conference on Services Computing, Proceedings
 |
| 会议录出版者 | IEEE COMPUTER SOC |
| 会议录出版地 | LOS ALAMITOS |
| 语种 | 英语 |
| ISBN号 | 978-0-7695-2751-2 |
| WOS记录号 | WOS:000244117800096 |
| 源URL | [http://ir.sia.cn/handle/173321/8071]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_工业控制系统研究室 |
| 推荐引用方式 GB/T 7714 | Zhang CH,Chang GS,Fan Y,et al. Coordination strategy for production planning in supply chain based on Lagrange relaxation algorithm[C]. 见:IEEE Asia-Pacific Services Computing Conference (APSCC 2006). Guangzhou, China. December 12-15, 2006. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。