%0 Journal Article
%T PARALLEL SCHEDULING PROBLEM WITH NON-SIMULTANEOUS MACHINE AVAILABLE TIMES<br>带机器准备时间的平行机排序问题
%A LI Weidong
%A LI Jianbo
%A LI Jianping
%A ZHANG Tongquan
%A <br>李伟东
%A 李建波
%A 李建平
%A 张同全
%J 系统科学与数学
%D 2010
%I 
%X This paper is concerned with the parallel scheduling problem on $m$ machines with non-simultaneous machine available times. A polynomial-time approximation scheme with running time $O(mn)$ for the general case and a full polynomial-time approximation scheme with running time $O(n)$ for the fixed number $m$ of machines are presented.
%K Operations research
%K scheduling
%K non-simultaneous machine available times
%K polynomial-time approximation scheme
%K full polynomial-time approximation scheme<br>运筹学
%K 排序
%K 带机器准备时间
%K 多项式时间近似方案
%K 全多项式时间近似方案.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=20445147689863D58936E3F0072924D2&yid=140ECF96957D60B2&vid=340AC2BF8E7AB4FD&iid=E158A972A605785F&sid=DDEED1BDDBFAA8A7&eid=78976D931AD1540F&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=16