首页 | 本学科首页   官方微博 | 高级检索  
     检索      

带机器准备时间的平行机排序问题
引用本文:李伟东,李建波,李建平,张同全.带机器准备时间的平行机排序问题[J].系统科学与数学,2010,30(4):433-440.
作者姓名:李伟东  李建波  李建平  张同全
作者单位:1. 云南大学数学与统计学院数学系,昆明,650091
2. 昆明理工大学管理与经济学院,昆明,650093
3. 云南民族大学数学与计算机科学学院,昆明,650031
基金项目:国家自然科学基金,云南省中青年学术技术带头人基金,云南大学校级重点培养基金 
摘    要:研究了带机器准备时间的m台平行机排序问题,设计出了一个多项式时间近似方案(PTAS),并给出了一个机器数m为固定常数的情形下的全多项式时间近似方案(FPTAS).

关 键 词:运筹学  排序  带机器准备时间  多项式时间近似方案  全多项式时间近似方案.
收稿时间:2008-12-23
修稿时间:2009-7-16

PARALLEL SCHEDULING PROBLEM WITH NON-SIMULTANEOUS MACHINE AVAILABLE TIMES
LI Weidong,LI Jianbo,LI Jianping,ZHANG Tongquan.PARALLEL SCHEDULING PROBLEM WITH NON-SIMULTANEOUS MACHINE AVAILABLE TIMES[J].Journal of Systems Science and Mathematical Sciences,2010,30(4):433-440.
Authors:LI Weidong  LI Jianbo  LI Jianping  ZHANG Tongquan
Institution:(1)Department of Mathematics, School of Mathematics and Statistics, Yunnan University 650091;(2)School of Management and Economics Kunming University of Science and Technology 650093;(3)Department of Mathematics, School of Mathematics and Statistics, Yunnan University,650091;(4)School of Mathematics and Computer Science Yunnan Nationalities University 650031
Abstract: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.
Keywords:Operations research  scheduling  non-simultaneous machine available times  polynomial-time approximation scheme  full polynomial-time approximation scheme  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统科学与数学》浏览原始摘要信息
点击此处可从《系统科学与数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号