咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Load Balancing for Interdependent IoT Microservices
Load Balancing for Interdependent IoT Microservices
收藏 引用
IEEE Conference on Computer Communications (IEEE INFOCOM)
作者: Yu, Ruozhou Kilari, Vishnu Teja Xue, Guoliang Yang, Dejun Arizona State Univ Tempe AZ 85287 USA Colorado Sch Mines Golden CO 80401 USA
Advances in virtualization technologies and edge computing have inspired a new paradigm for Internet-of-Things (IoT) application development. By breaking a monolithic application into loosely coupled microservices, gr... 详细信息
来源: 评论
A Dynamic Programming Approach for the Decentralized Control of Discrete Optimizers with Quadratic Utilities and Shared Constraint  28
A Dynamic Programming Approach for the Decentralized Control...
收藏 引用
28th Mediterranean Conference on Control and Automation (MED)
作者: Carli, Raffaele Dotoli, Mariagrazia Polytech Bari Dept Elect & Informat Engn Bari Italy
This paper addresses the problem of controlling a large set of agents, each with a quadratic utility function depending on individual combinatorial choices, and all sharing an affine constraint on available resources.... 详细信息
来源: 评论
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... 详细信息
来源: 评论
An FPTAS for the parallel two-stage flowshop problem
收藏 引用
Theoretical Computer Science 2017年 657卷 64-72页
作者: Jianming Dong Weitian Tong Taibo Luo Xueshi Wang Jueliang Hu Yinfeng Xu Guohui Lin Department of Mathematics Zhejiang Sci-Tech University Hangzhou Zhejiang 310018 China Department of Computing Science University of Alberta Edmonton Alberta T6G 2E8 Canada Department of Computer Sciences Georgia Southern University Statesboro GA 30458 USA Business School Sichuan University Chengdu Sichuan 610065 China State Key Lab for Manufacturing Systems Engineering Xi'an Shaanxi 710049 China
We consider the NP-hard m - parallel two-stage flowshop problem, abbreviated as the ( m , 2 ) -PFS problem, where we need to schedule n jobs to m parallel identical two-stage flowshops in order to minimize the makespa... 详细信息
来源: 评论