科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
N
Natalia V. Shakhlevich
university of leeds
19
H指数
64
论文数
1.0K
被引数
0
相关解读
订阅
收录论文
15
发表时间
发表时间
IF
被引数
Classification and evaluation of the algorithms for vector bin packing
矢量装箱算法的分类与评价
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2025-01-01
0
OA
AI
Mommessin, Clement; Erlebach, Thomas; Shakhlevich, Natalia V.
分享
收藏
Affinity-aware resource provisioning for long-running applications in shared clusters
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
IF
4
2023-07-01
7
OA
AI
Mommessin, Clement; Yang, Renyu; Shakhlevich, Natalia V.; Sun, Xiaoyang; Kumar, Satish; Xiao, Junqing; Xu, Jie
分享
收藏
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-05-01
34
OA
AI
Shioura, Akiyoshi; Shakhlevich, Natalia V.; Strusevich, Vitaly A.
分享
收藏
Complexity results for storage loading problems with stacking constraints
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2016-03-01
35
OA
AI
Bruns, Florian; Knust, Sigrid; Shakhlevich, Natalia V.
分享
收藏
Minimising the number of gap-zeros in binary matrices
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2013-08-01
2
OA
AI
Chakhlevitch, Konstantin; Glass, Celia A.; Shakhlevich, Natalia V.
分享
收藏
Tabu search and lower bounds for a combined production-transportation problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2013-03-01
27
OA
AI
Condotta, Alessandro; Knust, Sigrid; Meier, Dimitri; Shakhlevich, Natalia V.
分享
收藏
Scheduling with controllable release dates and processing times: Makespan minimization
具有可控发布日期和处理时间的计划: 最大限度地减少完工时间
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2006-12-01
19
PRE
AI
Cheng, T. C. Edwin; Kovalyov, Mikhail Y.; Shakhlevich, Natalia V.
分享
收藏
Scheduling with controllable release dates and processing times: Total completion time minimization
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2006-12-01
15
PRE
AI
Cheng, T. C. Edwin; Kovalyov, Mikhail Y.; Shakhlevich, Natalia V.
分享
收藏
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2005-09-01
3
OA
AI
Cheng, TCE; Shakhlevich, NV
分享
收藏
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
具有运输延迟的flow-shop和open-shop调度问题的复杂性结果
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2004-07-01
49
PRE
AI
Brucker, P; Knust, S; Cheng, TCE; Shakhlevich, NV
分享
收藏
Common due date assignment and scheduling with ready times
常见的到期日分配和计划就绪时间
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2002-12-01
25
PRE
AI
Cheng, TCE; Chen, ZL; Shakhlevich, NV
分享
收藏
Complexity of mixed shop scheduling problems: A survey
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2000-01-01
40
PRE
AI
Shakhlevich, NV; Sotskov, YN; Werner, F
分享
收藏
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
ANNALS OF OPERATIONS RESEARCH
IF
4.5
1999-01-01
10
PRE
AI
Shakhlevich, NV; Sotskov, YN; Werner, F
分享
收藏
On the solution region for certain scheduling problems with preemption
ANNALS OF OPERATIONS RESEARCH
IF
4.5
1998-01-01
4
PRE
AI
Brasel, H; Shakhlevich, N
分享
收藏
2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1993-11-01
9
PRE
AI
SHAKHLEVICH, NV; STRUSEVICH, VA
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
T
T.C.E. Cheng
H 指数: 96 · 论文数: 1.5K
F
Frank Werner
H 指数: 47 · 论文数: 466
P
Peter Brucker
H 指数: 46 · 论文数: 225
M
Mikhail Y. Kovalyov
H 指数: 36 · 论文数: 290
V
Vitaly A. Strusevich
H 指数: 35 · 论文数: 174
查看更多