Teacher Personal
Homepage

中文

Paper Publications

Home > Scientific Research > Paper Publications

An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities

Affiliation of Author(s):数学学院
Funded by:国家自然科学基金项目
First Author:furuyan
Indexed by:Journal paper
Document Code:paper_104407
Volume:34;34;1187-1197
ISSN No.:1382-6905
Translation or Not:no
Date of Publication:2017-05-16

Pre One:Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan

Next One:Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize 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