SIA OpenIR  > 数字工厂研究室
Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems
Ding XL(丁小丽); Liu C(刘昶); Zhu J(朱军); Li D(李冬)
Department数字工厂研究室
Conference Name11th World Congress on Intelligent Control and Automation (WCICA 2014)
Conference DateJune 29 - July 4, 2014
Conference PlaceShenyang, China
Source PublicationProceeding of the 11th World Congress on Intelligent Control and Automation, WCICA 2014
PublisherIEEE
Publication PlacePiscataway, NJ, USA
2014
Pages1257-1260
Indexed ByEI ; CPCI(ISTP)
EI Accession number20152600977521
WOS IDWOS:000393066201049
Contribution Rank1
ISBN978-1-4799-5825-2
KeywordHybrid Flow Shop Lagrangian Relaxation Earliness/tardiness Problem
AbstractThis 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.
Language英语
Citation statistics
Document Type会议论文
Identifierhttp://ir.sia.cn/handle/173321/16951
Collection数字工厂研究室
Affiliation1.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, China
2.University of Chinese Academy of Sciences, Beijing, China
Recommended Citation
GB/T 7714
Ding XL,Liu C,Zhu J,et al. Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems[C]. Piscataway, NJ, USA:IEEE,2014:1257-1260.
Files in This Item: Download All
File Name/Size DocType Version Access License
Lagrangian relaxatio(667KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ding XL(丁小丽)]'s Articles
[Liu C(刘昶)]'s Articles
[Zhu J(朱军)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ding XL(丁小丽)]'s Articles
[Liu C(刘昶)]'s Articles
[Zhu J(朱军)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ding XL(丁小丽)]'s Articles
[Liu C(刘昶)]'s Articles
[Zhu J(朱军)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Lagrangian relaxation algorithms for hybrid flow-shop with earliness_tardiness scheduling problems.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.