咨询与建议

限定检索结果

文献类型

  • 35 篇 期刊文献
  • 2 篇 会议

馆藏范围

  • 37 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 25 篇 管理学
    • 25 篇 管理科学与工程(可...
    • 8 篇 工商管理
  • 22 篇 工学
    • 15 篇 计算机科学与技术...
    • 3 篇 机械工程
    • 2 篇 电气工程
    • 2 篇 软件工程
    • 1 篇 信息与通信工程
    • 1 篇 控制科学与工程
  • 15 篇 理学
    • 14 篇 数学
    • 1 篇 统计学(可授理学、...
  • 9 篇 经济学
    • 9 篇 应用经济学
  • 1 篇 军事学

主题

  • 37 篇 fully polynomial...
  • 15 篇 scheduling
  • 11 篇 dynamic programm...
  • 5 篇 approximation al...
  • 5 篇 rejection penalt...
  • 4 篇 deteriorating jo...
  • 2 篇 approximation al...
  • 2 篇 makespan
  • 2 篇 np-hardness
  • 2 篇 knapsack problem
  • 1 篇 sum product rati...
  • 1 篇 single cover pro...
  • 1 篇 (minimal) defici...
  • 1 篇 trees
  • 1 篇 relative error
  • 1 篇 computational co...
  • 1 篇 weighted late wo...
  • 1 篇 load balancing
  • 1 篇 plural cover pro...
  • 1 篇 activation netwo...

机构

  • 5 篇 zhengzhou univ d...
  • 4 篇 hong kong polyte...
  • 3 篇 kunming univ sci...
  • 2 篇 dalian univ tech...
  • 2 篇 univ alberta dep...
  • 2 篇 zhejiang sci tec...
  • 2 篇 feng chia univ d...
  • 2 篇 shenyang normal ...
  • 1 篇 department of co...
  • 1 篇 natl cent univ i...
  • 1 篇 tokyo univ sci d...
  • 1 篇 hong kong polyte...
  • 1 篇 inform gmbh d-52...
  • 1 篇 fujian agr & for...
  • 1 篇 natl chi nan uni...
  • 1 篇 bar ilan univ de...
  • 1 篇 inseec u res ctr...
  • 1 篇 feng chia univ d...
  • 1 篇 natl chi nan uni...
  • 1 篇 hebrew univ jeru...

作者

  • 5 篇 yuan jinjiang
  • 4 篇 yin yunqiang
  • 4 篇 zhang liqi
  • 3 篇 cheng t. c. e.
  • 3 篇 lu lingfa
  • 3 篇 wu chin-chia
  • 3 篇 halman nir
  • 2 篇 wang du-juan
  • 2 篇 lin guohui
  • 2 篇 wang yan
  • 2 篇 nannicini giacom...
  • 2 篇 dong jianming
  • 2 篇 li shisheng
  • 2 篇 zhao chuanli
  • 1 篇 mondal debajyoti
  • 1 篇 jueliang hu
  • 1 篇 weitian tong
  • 1 篇 van de geer rube...
  • 1 篇 posner me
  • 1 篇 liu wenqi

语言

  • 33 篇 英文
  • 4 篇 其他
检索条件"主题词=Fully polynomial-time approximation scheme"
37 条 记 录,以下是31-40 订阅
排序:
Single-machine scheduling under the job rejection constraint
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第16-18期411卷 1877-1882页
作者: Zhang, Liqi Lu, Lingfa Yuan, Jinjiang Zhengzhou Univ Dept Math Zhengzhou 450001 Henan Peoples R China
In this paper, we consider single-machine scheduling problems under the job rejection constraint. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the single mac... 详细信息
来源: 评论
Single machine scheduling with release dates and rejection
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年 第3期198卷 975-978页
作者: Zhang, Liqi Lu, Lingfa Yuan, Jinjiang Zhengzhou Univ Dept Math Zhengzhou 450052 Henan Peoples R China
In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected. in which case a rejection penalty has to be paid, or accepted and processed on the machine. ... 详细信息
来源: 评论
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1-3期396卷 283-289页
作者: Lu, Lingfa Zhang, Liqi Yuan, Jinjiang Zhengzhou Univ Dept Math Zhengzhou 450052 Henan Peoples R China
In this paper, we consider the unbounded parallel batch machine scheduling with release dates and rejection. A job is either rejected with a certain penalty having to be paid, or accepted and processed in batches on t... 详细信息
来源: 评论
Lot-sizing with non-stationary cumulative capacities
收藏 引用
OPERATIONS RESEARCH LETTERS 2007年 第4期35卷 549-557页
作者: Sargut, F. Zeynep Romeijn, H. Edwin Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA
We study a new class of capacitated economic lot-sizing problems. We show that the problem is NP-hard in general and derive a fully polynomial-time approximation algorithm under mild conditions on the cost functions. ... 详细信息
来源: 评论
The approximability of the weighted Hamiltonian path completion problem on a tree
收藏 引用
THEORETICAL COMPUTER SCIENCE 2005年 第1-3期341卷 385-397页
作者: Wu, Q Lu, CL Lee, RCT Natl Chiao Tung Univ Dept Biol Sci & Technol Hsinchu 300 Taiwan Natl Chi Nan Univ Grad Inst Commun Engn Puli 545 Nantou Hsien Taiwan Natl Chi Nan Univ Dept Comp Sci & Informat Engn Puli 545 Nantou Hsien Taiwan
Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set such that the augmented graph has a Hamiltonian path. In this paper, we show that the Hamiltonian path completion problem will u... 详细信息
来源: 评论
On the complexity of approximating a KKT point of quadratic programming
收藏 引用
MATHEMATICAL PROGRAMMING 1998年 第2期80卷 195-211页
作者: Ye, YY Univ Iowa Coll Business Adm Dept Management Sci Iowa City IA 52242 USA
We present a potential reduction algorithm to approximate a Karush-Kuhn-Tucker (KKT) point of general quadratic programming (QP). We show that the algorithm is a fully polynomial-time approximation scheme, and its run... 详细信息
来源: 评论
approximation PROCEDURES FOR THE ONE-WAREHOUSE MULTIRETAILER SYSTEM
收藏 引用
MANAGEMENT SCIENCE 1994年 第10期40卷 1305-1316页
作者: LU, L POSNER, ME OHIO STATE UNIV DEPT IND & SYST ENGNCOLUMBUSOH 43210 USA
Two heuristic procedures for a one-warehouse multi-retailer system are developed. Based on the accuracy desired, the first heuristic evaluates a specified number of points. The relative error is within a bound that ap... 详细信息
来源: 评论