×
验证码:
换一张
忘记密码?
记住我
CORC
首页
科研机构
检索
知识图谱
申请加入
托管服务
登录
注册
在结果中检索
科研机构
大连理工大学 [4]
北京航空航天大学 [2]
西安交通大学 [1]
数学与系统科学研究院 [1]
上海大学 [1]
内容类型
期刊论文 [9]
发表日期
2018 [1]
2017 [3]
2016 [3]
2012 [1]
2007 [1]
×
知识图谱
CORC
开始提交
已提交作品
待认领作品
已认领作品
未提交全文
收藏管理
QQ客服
官方微博
反馈留言
浏览/检索结果:
共9条,第1-9条
帮助
已选(
0
)
清除
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
作者升序
作者降序
题名升序
题名降序
发表日期升序
发表日期降序
提交时间升序
提交时间降序
Single-machine scheduling and common due date assignment with potential machine disruption
期刊论文
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 卷号: 56, 页码: 1345-1360
作者:
Xiong, Xiaoyun
;
Wang, Dujuan
;
Cheng, T. C. Edwin
;
Wu, Chin-Chia
;
Yin, Yunqiang
收藏
  |  
浏览/下载:8/0
  |  
提交时间:2019/12/02
scheduling
dynamic programming
disruption management
due date assignment
fully polynomial-time approximation scheme
A new fully polynomial time approximation scheme for the interval subset sum problem
期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:
Diao, Rui
;
Liu, Ya-Feng
;
Dai, Yu-Hong
收藏
  |  
浏览/下载:22/0
  |  
提交时间:2018/07/30
Interval subset sum problem
Computational complexity
Solution structure
Fully polynomial time approximation scheme
Worst-case performance
An FPTAS for the parallel two-stage flowshop problem
期刊论文
THEORETICAL COMPUTER SCIENCE, 2017, 卷号: 657, 页码: 64-72
作者:
Dong, Jianming
;
Tong, Weitian
;
Luo, Taibo
;
Wang, Xueshi
;
Hu, Jueliang
收藏
  |  
浏览/下载:10/0
  |  
提交时间:2019/11/26
Two-stage flowshop scheduling
Fully polynomial-time approximation scheme
Dynamic programming
Multiprocessor scheduling
Makespan
An Approach to Web Services Selection for Multiple Users
期刊论文
IEEE ACCESS, 2017, 卷号: 5, 页码: 15093-15104
作者:
Zhu, Wenlong
;
Yin, Beibei
;
Gong, Siqian
;
Cai, Kai-Yuan
收藏
  |  
浏览/下载:7/0
  |  
提交时间:2019/12/30
Advanced a-fully polynomial time approximation scheme
artificial bee colony algorithm
multiple users
Pareto optimal set
web service selection
Approximation Schemes for Single-Machine Scheduling with a Fixed Maintenance Activity to Minimize the Total Amount of Late Work
期刊论文
NAVAL RESEARCH LOGISTICS, 2016, 卷号: 63, 页码: 172-183
作者:
Yin, Yunqiang
;
Xu, Jianyou
;
Cheng, T. C. E. Edwin
;
Wu, Chin-Chia
;
Wang, Du-Juan
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2019/12/09
scheduling
late work
fully polynomial-time approximation scheme
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
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2019/12/09
Scheduling
Batch delivery
Two agents
Fully polynomial-time approximation scheme
Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
期刊论文
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 卷号: 252, 页码: 737-749
作者:
Yin, Yunqiang
;
Cheng, T. C. E.
;
Wang, Du-Juan
收藏
  |  
浏览/下载:11/0
  |  
提交时间:2019/12/09
Combinatorial optimization
Production
Rescheduling
Bicriterion analysis
Two-dimensional fully polynomial-time approximation scheme
A two stage scheduling with transportation and batching
期刊论文
INFORMATION PROCESSING LETTERS, 2012, 卷号: 112, 页码: 728-731
作者:
Zhu, Hongli
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2020/01/06
Scheduling
Transportation
NP-hard
Fully polynomial time approximation scheme
A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
期刊论文
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2007, 卷号: 109, 页码: 180-184
作者:
Kang, Liying[1]
;
Ng, C. T.[2]
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2019/05/10
deteriorating jobs
fully polynomial-time approximation scheme
parallel-machine scheduling
©版权所有 ©2017 CSpace - Powered by
CSpace