Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems
文献类型：会议论文
| 作者 | Ding XL(丁小丽) ; Liu C(刘昶); Zhu J(朱军); Li D(李冬)
|
| 出版日期 | 2014 |
| 会议名称 | 11th World Congress on Intelligent Control and Automation (WCICA 2014) |
| 会议日期 | June 29 - July 4, 2014 |
| 会议地点 | Shenyang, China |
| 关键词 | Hybrid flow shop Lagrangian relaxation Earliness/Tardiness problem |
| 页码 | 1257-1260 |
| 中文摘要 | This paper considers the characteristics of a hybrid flow shop with JIT technical constraints. Lagrangian relaxation is presented to solve the Earliness/Tardiness problem in the hybrid flow-shop. By introducing precedence constraints into the objective function, the original problem is decomposed into a series of parallel machine sub-problems and a dynamic programming algorithm is designed to solve these sub-problems. Heuristic approach is further applied to convert the infeasible solution into a feasible solution. Testing results demonstrated that the proposed method can generate near optimal schedules in an acceptable computational time. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议录 | Proceeding of the 11th World Congress on Intelligent Control and Automation, WCICA 2014
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | Piscataway, NJ, USA |
| 语种 | 英语 |
| ISBN号 | 978-1-4799-5825-2 |
| 源URL | [http://ir.sia.cn/handle/173321/16951]  |
| 专题 | 沈阳自动化研究所_数字工厂研究室 |
| 推荐引用方式 GB/T 7714 | Ding XL,Liu C,Zhu J,et al. Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems[C]. 见:11th World Congress on Intelligent Control and Automation (WCICA 2014). Shenyang, China. June 29 - July 4, 2014. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。