咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
A COMPUTATIONALLY EFFICIENT FPTAS FOR CONVEX STOCHASTIC DYNAMIC PROGRAMS
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2015年 第1期25卷 317-350页
作者: Halman, Nir Nannicini, Giacomo Orlin, James Hebrew Univ Jerusalem Jerusalem Sch Business Adm Jerusalem Israel MIT Dept Civil & Environm Engn Cambridge MA 02139 USA Singapore Univ Technol & Design Engn Syst & Design Singapore Singapore MIT Sloan Sch Management Cambridge MA 02139 USA
We propose a computationally efficient fully polynomial-time approximation scheme (FPTAS) to compute an approximation with arbitrary precision of the value function of convex stochastic dynamic programs, using the tec... 详细信息
来源: 评论
Static and dynamic source locations in undirected networks
收藏 引用
TOP 2015年 第3期23卷 619-646页
作者: Turner, Lara Gross, Dwi Poetranto Hamacher, Horst W. Krumke, Sven O. Univ Kaiserslautern Dept Math D-67653 Kaiserslautern Germany INFORM GmbH D-52076 Aachen Germany
Results from source location in the form of single cover problems in static networks are reviewed and extended by new results for the most general problem with arbitrary demands and costs. The matroidal structure of t... 详细信息
来源: 评论
Efficient computation of evacuation routes on a three-dimensional geometric network
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2014年 76卷 231-242页
作者: Tang, Huajun Elalouf, Amir Levner, Eugene Cheng, T. C. E. Macau Univ Sci & Technol Sch Business Macau Peoples R China Bar Ilan Univ Dept Management Ramat Gan Israel Ashkelon Acad Coll Sch Econ Ashqelon Israel Hong Kong Polytech Univ Fac Business Hong Kong Hong Kong Peoples R China
We consider a real-time emergency evacuation problem that seeks to compute a set of rapid evacuation routes in a building. Given a three-dimensional geometric structure of the evacuation network, an emergency evacuati... 详细信息
来源: 评论
A new graphical approach for solving single-machine scheduling problems approximately
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年 第13期52卷 3762-3777页
作者: Gafarov, Evgeny R. Dolgui, Alexandre Werner, Frank Ecole Natl Super Mines UMR CNRS 6158 LIMOS F-42023 St Etienne France Russian Acad Sci Inst Control Sci Moscow Russia Univ Magdeburg Fak Math D-39106 Magdeburg Germany
Often the problem of determining an optimal or approximate production schedule in a company can be reduced to the problem of solving a scheduling problem on a bottleneck machine. However, even the majority of the resu... 详细信息
来源: 评论
Single Machine Scheduling with an Availability Constraint and Rejection
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2014年 第5期31卷 1450037-1450037页
作者: Zhao, Chuanli Tang, Hengyong Shenyang Normal Univ Sch Math & Syst Sci Shenyang 110034 Liaoning Peoples R China
This paper considers single machine scheduling with an availability constraint and rejection. It is assumed that the machine is not available for processing during a given time interval. A job is either rejected, in w... 详细信息
来源: 评论
Route-Enabling Graph Orientation Problems
收藏 引用
ALGORITHMICA 2013年 第2期65卷 317-338页
作者: Ito, Takehiro Miyamoto, Yuichiro Ono, Hirotaka Tamaki, Hisao Uehara, Ryuhei Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Sophia Univ Fac Sci & Technol Chiyoda Ku Tokyo 1028554 Japan Kyushu Univ Fac Econ Higashi Ku Fukuoka 8128581 Japan Meiji Univ Sch Sci & Technol Tama Ku Kawasaki Kanagawa 2148571 Japan JAIST Sch Informat Sci Nomi Ishikawa 9231292 Japan
Given an undirected and edge-weighted graph G together with a set of ordered vertex-pairs, called st-pairs, we consider two problems of finding an orientation of all edges in G: min-sum orientation is to minimize the ... 详细信息
来源: 评论
A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2007年 第1-2期109卷 180-184页
作者: Kang, Liying Ng, C. T. Shanghai Univ Dept Math Shanghai 200444 Peoples R China Hong Kong Polytech Univ Dept Logist Hong Kong Peoples R China
In this paper we study the NP-hard problem of scheduling n deteriorating jobs on in identical parallel machines to minimize the makespan. Each job's processing time is a linear nondecreasing function of its start ... 详细信息
来源: 评论
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第4-5期412卷 275-280页
作者: Fan, Baoqiang Li, Shisheng Zhou, Li Zhang, Liqi Ludong Univ Dept Math & Informat Yantai 264025 Peoples R China Zhengzhou Univ Dept Math Zhengzhou 450001 Peoples R China
We consider a problem of scheduling resumable deteriorating jobs on a single machine with non-availability constraints. The objective is to minimize the total completion time. We prove that the problem with a single n... 详细信息
来源: 评论
Parallel-machine scheduling with deteriorating jobs and rejection
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第40-42期411卷 3642-3650页
作者: Li, Shisheng Yuan, Jinjiang Zhengzhou Univ Dept Math Zhengzhou 450001 Henan Peoples R China
We consider several parallel-machine scheduling problems in which the processing time of a job is a (simple) linear increasing function of its starting time and jobs can be rejected by paying penalties. The objective ... 详细信息
来源: 评论
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2010年 第1期200卷 305-308页
作者: Gawiejnowicz, Stanislaw Kononov, Alexander Adam Mickiewicz Univ Fac Math & Comp Sci PL-61614 Poznan Poland Sobolev Inst Math Novosibirsk 630090 Russia
A set of independent, resumable and proportionally deteriorating jobs is to be executed on a single machine. The machine is not continuously available for processing but the number of non-availability periods, the sta... 详细信息
来源: 评论