咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
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... 详细信息
来源: 评论
approximation schemes for Single-Machine Scheduling with a Fixed Maintenance Activity to Minimize the Total Amount of Late Work
收藏 引用
NAVAL RESEARCH LOGISTICS 2016年 第2期63卷 172-183页
作者: Yin, Yunqiang Xu, Jianyou Cheng, T. C. E. Edwin Wu, Chin-Chia Wang, Du-Juan Kunming Univ Sci & Technol Dept Math Kunming 650093 Peoples R China Northeastern Univ Dept Automat Coll Informat Sci & Engn Shenyang 110819 Peoples R China Hong Kong Polytech Univ Dept Logist & Maritime Studies Kowloon Hong Kong Peoples R China Feng Chia Univ Dept Stat Taichung 40724 Taiwan Dalian Univ Technol Inst Informat & Decis Technol Sch Management Sci & Engn Dalian 116023 Peoples R China
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal jo... 详细信息
来源: 评论
An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第4期44卷 2167-2179页
作者: Zhang, Long Zhang, Yuzhong Bai, Qingguo Qufu Normal Univ Inst Operat Res Sch Management Rizhao 276826 Shandong Peoples R China
This paper studies single machine scheduling with batch deliveries, where a common due window for all jobs has to be determined, not given in advance. The objective is to minimize the overall cost for the process and ... 详细信息
来源: 评论
SINGLE-MACHINE PARETO-SCHEDULING WITH MULTIPLE WEIGHTING VECTORS FOR MINIMIZING THE TOTAL WEIGHTED LATE WORKS
收藏 引用
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2021年 第1期19卷 456-471页
作者: Guo, Shuen Geng, Zhichao Yuan, Jinjiang Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Henan Peoples R China
In this paper, we study the single-machine Pareto-scheduling of jobs with multiple weighting vectors for minimizing the total weighted late works. Each weighting vector has its corresponding weighted late work. The go... 详细信息
来源: 评论
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 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... 详细信息
来源: 评论
Minimum shared-power edge cut
收藏 引用
NETWORKS 2020年 第3期75卷 321-333页
作者: Cabello, Sergio Jain, Kshitij Lubiw, Anna Mondal, Debajyoti Univ Ljubljana Dept Math Ljubljana Slovenia IMFM Ljubljana Slovenia Borealis AI Waterloo ON Canada Univ Waterloo Sch Comp Sci Waterloo ON Canada Univ Saskatchewan Dept Comp Sci Saskatoon SK Canada
We introduce a problem called minimum shared-power edge cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning &... 详细信息
来源: 评论
On the sum-product ratio problem and its applications
收藏 引用
OPERATIONS RESEARCH LETTERS 2016年 第3期44卷 409-414页
作者: Wang, Ruxian Johns Hopkins Carey Business Sch Baltimore MD 21202 USA
We study the so-called sum-product ratio problem, under which the numerator is the sum of numbers in a subset and the denominator is the product of numbers in the same subset. Unlike the sum-sum ratio problem, which c... 详细信息
来源: 评论
Two-agent single-machine scheduling to minimize the batch delivery cost
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2016年 92卷 16-30页
作者: Yin, Yunqiang Wang, Yan Cheng, T. C. E. Wang, Du-Juan Wu, Chin-Chia Kunming Univ Sci & Technol Fac Sci Kunming 650093 Peoples R China Hong Kong Polytech Univ Dept Logist & Maritime Studies Kowloon Hong Kong Peoples R China Dalian Univ Technol Sch Management Sci & Engn Dalian 116023 Peoples R China Feng Chia Univ Dept Stat Taichung 40724 Taiwan
We consider integrated production and batch delivery scheduling in a make-to-order production system involving two competing agents, each of which having its own job set competes to process its jobs on a shared single... 详细信息
来源: 评论
approximation algorithms for the three-machine proportionate mixed shop scheduling
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 803卷 57-70页
作者: Liu, Longcheng Chen, Yong Dong, Jianming Goebel, Randy Lin, Guohui Luo, Yue Ni, Guanqun Su, Bing Xu, Yao Zhang, An Xiamen Univ Sch Math Sci Xiamen Peoples R China Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Hangzhou Dianzi Univ Dept Math Hangzhou Peoples R China Zhejiang Sci Tech Univ Dept Math Hangzhou Peoples R China Fujian Agr & Forestry Univ Coll Management Fuzhou Peoples R China Xian Technol Univ Sch Econ & Management Xian Peoples R China
A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-sh... 详细信息
来源: 评论