ISCAS OpenIR
minimizing makespan on a single batching machine with release times and non-identical job sizes
Li SG; Li GJ; Wang XL; Liu QM
2005
SourceOPERATIONS RESEARCH LETTERS
ISSN0167-6377
Volume33Issue:2Pages:157-164
Indexed Typesci ; sciencedirect ; ei
KeywordApproximation Algorithms Scheduling Batch Processing Makespan Release Times
DepartmentYantai Univ, Dept Math & Informat Sci, Yantai 264005, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Yantai Normal Univ, Sch Comp Sci & Technol, Yantai 264025, Peoples R China.
SubjectOperations Research & Management Science
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/12476
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li SG,Li GJ,Wang XL,et al. minimizing makespan on a single batching machine with release times and non-identical job sizes[J]. OPERATIONS RESEARCH LETTERS,2005,33(2):157-164.
APA Li SG,Li GJ,Wang XL,&Liu QM.(2005).minimizing makespan on a single batching machine with release times and non-identical job sizes.OPERATIONS RESEARCH LETTERS,33(2),157-164.
MLA Li SG,et al."minimizing makespan on a single batching machine with release times and non-identical job sizes".OPERATIONS RESEARCH LETTERS 33.2(2005):157-164.
Files in This Item:
File Name/Size DocType Version Access License
minimizing makespan (214KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li SG]'s Articles
[Li GJ]'s Articles
[Wang XL]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li SG]'s Articles
[Li GJ]'s Articles
[Wang XL]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li SG]'s Articles
[Li GJ]'s Articles
[Wang XL]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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