咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 108 篇 工学
    • 90 篇 计算机科学与技术...
    • 18 篇 电气工程
    • 15 篇 软件工程
    • 11 篇 信息与通信工程
    • 7 篇 机械工程
    • 6 篇 控制科学与工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 石油与天然气工程
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 轻工技术与工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 食品科学与工程(可...
  • 63 篇 理学
    • 60 篇 数学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 37 篇 管理学
    • 37 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 9 篇 经济学
    • 9 篇 应用经济学
  • 2 篇 医学
    • 2 篇 临床医学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学
    • 1 篇 畜牧学
  • 1 篇 军事学

主题

  • 157 篇 on-line algorith...
  • 23 篇 scheduling
  • 21 篇 competitive anal...
  • 17 篇 competitive rati...
  • 11 篇 approximation al...
  • 10 篇 worst-case analy...
  • 6 篇 bin packing
  • 5 篇 single machine
  • 5 篇 makespan
  • 5 篇 delivery time
  • 5 篇 supply chain sch...
  • 4 篇 load balancing
  • 4 篇 lower bound
  • 4 篇 computational ge...
  • 4 篇 randomized algor...
  • 4 篇 combinatorial op...
  • 4 篇 preemption
  • 3 篇 delivery cost
  • 3 篇 graph
  • 3 篇 approximation

机构

  • 6 篇 zhejiang univ co...
  • 6 篇 zhengzhou univ d...
  • 5 篇 zhejiang univ de...
  • 4 篇 mit alfred p slo...
  • 3 篇 zhengzhou univ s...
  • 3 篇 henan univ techn...
  • 2 篇 univ louisville ...
  • 2 篇 zhongyuan univ t...
  • 2 篇 graz tech univ i...
  • 2 篇 zhengzhou inst a...
  • 2 篇 e china univ sci...
  • 2 篇 eindhoven univ t...
  • 2 篇 tech univ berlin...
  • 2 篇 univ calif santa...
  • 2 篇 henan agr univ c...
  • 2 篇 australian natl ...
  • 2 篇 hiroshima univ g...
  • 2 篇 hong kong polyte...
  • 2 篇 fern univ hagen ...
  • 2 篇 beijing univ pos...

作者

  • 6 篇 ye deshi
  • 5 篇 schulz as
  • 5 篇 zhang gc
  • 4 篇 lu lingfa
  • 4 篇 lu xiwen
  • 4 篇 woeginger gj
  • 3 篇 yuan jinjiang
  • 3 篇 averbakh igor
  • 3 篇 tamassia r
  • 3 篇 skutella m
  • 3 篇 vestjens apa
  • 3 篇 zhang guochuan
  • 3 篇 tian ji
  • 3 篇 mu yundong
  • 3 篇 fu ruyan
  • 3 篇 zhang liqi
  • 2 篇 giorgio ausiello
  • 2 篇 he qinming
  • 2 篇 li wenjie
  • 2 篇 cai yuhua

语言

  • 151 篇 英文
  • 6 篇 其他
检索条件"主题词=On-line algorithm"
157 条 记 录,以下是51-60 订阅
排序:
AVERAGE-CASE ANALYSIS OF THE MODIFIED HARMONIC algorithm
收藏 引用
algorithmICA 1989年 第4期4卷 519-533页
作者: RAMANAN, P TSUGA, K 1. Department of Computer Science University of California 93106 Santa Barbara CA USA
In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This... 详细信息
来源: 评论
New results on two-machine flow-shop scheduling with rejection
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年 第4期31卷 1493-1504页
作者: Zhang, Liqi Lu, Lingfa Li, Shisheng Henan Agr Univ Coll Informat & Management Sci Zhengzhou 450003 Henan Peoples R China Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Henan Peoples R China Zhongyuan Univ Technol Coll Sci Zhengzhou 450007 Henan Peoples R China
In this paper, we consider the off-line and on-line two-machine flow-shop scheduling problems with rejection. The objective is to minimize the sum of the makespan of accepted jobs and the total rejection penalty of re... 详细信息
来源: 评论
How to find a point on a line within a fixed distance
收藏 引用
DISCRETE APPLIED MATHEMATICS 1999年 第1期93卷 67-73页
作者: Hipke, C Icking, C Klein, R Langetepe, E Fern Univ Hagen D-58084 Hagen Germany Univ Freiburg Inst Informat D-79110 Freiburg Germany
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in the worst case. This competitive factor... 详细信息
来源: 评论
The polygon exploration problem
收藏 引用
SIAM JOURNAL ON COMPUTING 2001年 第2期31卷 577-600页
作者: Hoffmann, F Icking, C Klein, R Kriegel, K Free Univ Berlin Inst Informat D-14195 Berlin Germany Fern Univ Hagen D-58084 Hagen Germany Univ Bonn Inst Informat 1 D-53117 Bonn Germany
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be... 详细信息
来源: 评论
On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2015年 第3期244卷 704-714页
作者: Han, Bin Zhang, Wenjun Lu, Xiwen Lin, Yingzi E China Univ Sci & Technol Complex & Intelligent Syst Ctr Shanghai 200237 Peoples R China Univ Saskatchewan Dept Mech Engn Saskatoon SK S7N 5A9 Canada Northeastern Univ Dept Mech & Ind Engn Boston MA 02115 USA
This paper investigates minimization of both the makespan and delivery costs in on-line supply chain scheduling for single-machine and parallel-machine configurations in a transportation system with a single customer.... 详细信息
来源: 评论
Single machine scheduling with release dates
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第2期15卷 165-192页
作者: Goemans, MX Queyranne, M Schulz, AS Skutella, M Wang, YG MIT Dept Math Cambridge MA 02139 USA CORE Louvain Belgium Univ British Columbia Fac Commerce & Business Adm Vancouver BC V6T 1Z2 Canada MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA Tech Univ Berlin Dept Math D-1000 Berlin Germany Tech Univ Berlin Inst Math Fak Math & Nat Wissensch 2 D-10623 Berlin Germany Peoplesoft Inc Pleasanton CA 94588 USA
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ... 详细信息
来源: 评论
On-line scheduling of parallel machines to minimize total completion times
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2009年 第9期36卷 2647-2652页
作者: Liu, Peihai Lu, Xiwen E China Univ Sci & Technol Sch Sci Shanghai 200237 Peoples R China
In this paper, we consider the scheduling problem on identical parallel machines, in which jobs are arriving over time and preemption is not allowed. The goal is to minimize the total completion times. According to th... 详细信息
来源: 评论
On-line supply chain scheduling problems with preemption
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年 第1期181卷 500-504页
作者: Averbakh, Igor Xue, Zhihui Univ Toronto Div Management Scarborough ON M1C 1A4 Canada
We consider supply chain scheduling problems where customers release jobs to a manufacturer that has to process the jobs and deliver them to the customers. The jobs are released on-line, that is, at any time there is ... 详细信息
来源: 评论
Solution to a problem of Nicolas Lichiardopol
收藏 引用
DISCRETE MATHEMATICS 2010年 第2期310卷 360-363页
作者: Philpotts, Adam R. Waters, Robert J. Univ Bristol Dept Math Bristol BS8 1TW Avon England Univ Nottingham Sch Math Sci Nottingham NG7 2RD England
We present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sorting of a sequence of integers. (C) 2008 Elsevier B.V. All rights reserved.
来源: 评论
A note on on-line scheduling with partial information
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2002年 第3-4期44卷 539-543页
作者: Zhang, GC Ye, DS Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China
We consider a variant of on-line scheduling, where partial information on future jobs is known beforehand. Assume that the last job will be the longest (with the longest execution time). We provide the best possible o... 详细信息
来源: 评论