Teacher Personal
Homepage

中文

Paper Publications

Home > Scientific Research > Paper Publications

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

Affiliation of Author(s):数学学院
Funded by:国家自然科学基金项目
First Author:原晋江
Co-author:furuyan
Indexed by:Journal paper
Document Code:paper_87830
Volume:14;4;361-369
ISSN No.:1094-6316
Translation or Not:no
Date of Publication:2011-08-14

Pre One:Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

Next One:Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

|Click:Times

Address:No1,Daxue Road,Xuzhou,Jiangsu,221116,P.R.China Email: master@cumt.edu.cn
All Rights Reserved by China University of Mining and Technology