%0 Journal Article
%T Independent Tasks Scheduling on Identical Parallel Processors<br>同等并行处理机上独立任务的调度
%A Kang Yimei
%A Zheng Yingping
%A <br>康一梅
%A 郑应平
%J 自动化学报
%D 1997
%I 
%X The problem of nonpreemtively scheduling n independent tasks on m identical parallel processors in order to minimize the makespan is one of the fundamental problems of deterministic scheduling theory. In this paper, an algorithm called Bound Fit is presented. This algorithm has the same or better worst case performance with shorter running time.
%K Identical parallel processor
%K nonpreemptive scheduling
%K heuristic<br>同等并行处理机
%K 非抢先调度
%K 启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=E4A6FB2E6E8B87BE096702D66449CC12&yid=5370399DC954B911&vid=EA389574707BDED3&iid=CA4FD0336C81A37A&sid=35FC3610259C2B32&eid=656F8C8401D91023&journal_id=0254-4156&journal_name=自动化学报&referenced_num=5&reference_num=0