Best semi-online algorithms for unbounded parallel batch scheduling期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Best semi-online algorithms for unbounded parallel batch scheduling

Authors:	Jinjiang YuanCT Ng TCE Cheng

Institution:	^a Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450001, People’s Republic of China ^b Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China

Abstract:

Keywords:	Parallel batch scheduling Online algorithm Information in advance Competitive ratio
本文献已被 ScienceDirect 等数据库收录！