ISCAS OpenIR
minimizing makespan with release times on identical parallel batching machines
Li SG; Li GJ; Zhang SQ
2005
SourceDISCRETE APPLIED MATHEMATICS
ISSN0166-218X
Volume148Issue:1Pages:127-134
Indexed Typesci ; acm ; sciencedirect ; ei
KeywordPolynomial Time Approximation Scheme Identical Parallel Hatching Machines Scheduling Makespan
DepartmentYantai Univ, Dept Math & Informat Sci, Yantai 264005, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Tianjin Normal Univ, Sch Comp & Informat Engn, Tianjin 300074, Peoples R China.
SubjectMathematics, Applied
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/12474
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li SG,Li GJ,Zhang SQ. minimizing makespan with release times on identical parallel batching machines[J]. DISCRETE APPLIED MATHEMATICS,2005,148(1):127-134.
APA Li SG,Li GJ,&Zhang SQ.(2005).minimizing makespan with release times on identical parallel batching machines.DISCRETE APPLIED MATHEMATICS,148(1),127-134.
MLA Li SG,et al."minimizing makespan with release times on identical parallel batching machines".DISCRETE APPLIED MATHEMATICS 148.1(2005):127-134.
Files in This Item:
File Name/Size DocType Version Access License
minimizing makespan (175KB) 开放获取--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
[Zhang SQ]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li SG]'s Articles
[Li GJ]'s Articles
[Zhang SQ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li SG]'s Articles
[Li GJ]'s Articles
[Zhang SQ]'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.