科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
R
Rabia Nessah
centre national de la recherche scientifique (cnrs)
13
H指数
117
论文数
505
被引数
0
相关解读
订阅
收录论文
12
发表时间
发表时间
IF
被引数
The Minimization of the Weighted Completion Time Variance in a Single Machine: A Specialized Cutting-Plane Approach
加权完成时间方差在单机上的最小化:一种专门化的割平面方法
European Journal of Operational Research
IF
6
2026-03-23
0
PRE
AI
Stefano Nasini; Rabia Nessah
分享
收藏
Learning paths to multi-sector equilibrium: Belief dynamics under uncertain returns to scale
通往多部门均衡的学习路径:规模报酬不确定下的信念动态
Journal of Mathematical Economics
IF
0.7
2025-12-01
0
PRE
AI
Nasini, Stefano; Nessah, Rabia; Wigniolle, Bertrand
分享
收藏
Natural divisibility bridging convex and nonconvex technologies: Bargaining-based estimation by cost and revenue functions
自然可分性连接凸与非凸技术:基于成本和收益函数的议价估计
European Journal of Operational Research
IF
6
2025-08-05
0
PRE
AI
Kristiaan Kerstens; Stefano Nasini; Rabia Nessah
分享
收藏
Time-flexible min completion time variance in a single machine by quadratic programming
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2024-01-01
2
OA
AI
Nasini, Stefano; Nessah, Rabia
分享
收藏
A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
IF
10
2022-09-01
2
OA
AI
Nasini, Stefano; Nessah, Rabia
分享
收藏
An almost exact solution to the min completion time variance in a single machine
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2021-10-01
5
OA
AI
Nasini, Stefano; Nessah, Rabia
分享
收藏
Absolute optimal solution for a compact and convex game
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2013-01-01
9
PRE
AI
Nessah, Rabia; Tazdait, Tarik
分享
收藏
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2012-03-01
14
PRE
AI
Nessah, Rabia; Kacem, Imed
分享
收藏
A lower bound for weighted completion time variance
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2010-12-01
10
PRE
AI
Nessah, Rabia; Chu, Chengbin
分享
收藏
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2010-05-07
4
PRE
AI
Nessah, Rabia; Chu, Chengbin
分享
收藏
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
在具有作业发布日期的相同并行机器上最小化总加权完成时间的分支定界算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2008-04-01
30
PRE
AI
Nessah, Rabia; Yalaoui, Farouk; Chu, Chengbin
分享
收藏
An exact method for Pm/sds, ri/Σni=1 Ci problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2007-09-01
22
PRE
AI
Nessah, Rabia; Chu, Chengbin; Yalaoui, Farouk
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
C
Chengbin Chu
H 指数: 56 · 论文数: 429
K
Kristiaan Kerstens
H 指数: 33 · 论文数: 259
F
Farouk Yalaoui
H 指数: 31 · 论文数: 497
I
Imed Kacem
H 指数: 21 · 论文数: 213
S
Stefano Nasini
H 指数: 9 · 论文数: 52
查看更多