设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(3)
CNKI会议论文(3)
CNKI学位论文(241)
知网期刊论文(240)
在“
Elsevier电子期刊
”中,
命中:
257
条,耗时:小于0.01 秒
在所有数据库中总计命中:
487
条
1.
Makespan
minimization
for MapReduce systems with different servers
作者:
Yiwei Jiang
a
;
ywjiang@zstu.edu.cn" class="auth_mail" title="E-mail the corresponding author
Author Vitae
;
Yuqing Zhu
b
Author Vitae
;
Weili Wu
c
Author Vitae
;
Deying Li
d
Author Vitae
关键词:
MapReduce
;
Scheduling algorithm
;
Worst-case ratio
;
Big data
刊名:Future Generation Computer Systems
出版年:2017
2.
Scheduling on parallel processors with varying processing times
作者:
Radosław Rudek
;
rudek.radoslaw@gmail.com
;
radoslaw.rudek@ue.wroc.pl
关键词:
Scheduling
;
Parallel processors
;
Learning effect
;
Aging effect
;
Dynamic programming
;
FPTAS
刊名:Computers & Operations Research
出版年:2017
3.
An ACO algorithm for
makespan
minimization
in parallel batch machines with non-identical job sizes and incompatible job families
作者:
Zhao-hong Jia
a
;
b
;
zhjia@mail.ustc.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Chao Wang
b
;
chaowang_ahu@163.com" class="auth_mail" title="E-mail the corresponding author
;
Joseph Y.-T. Leung
c
;
d
;
leung@njit.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Parallel batch machines
;
Max&ndash
;
Min Ant System
;
NP-hard
;
Incompatible job families
;
Makespan
刊名:Applied S
of
t Computing
出版年:2016
4.
Two-machine job shop problem for
makespan
minimization
under availability constraint
作者:
Mourad Benttaleb
*
;
mourad.benttaleb@utt.fr
;
Faicel Hnaien
*
;
faicel.hnaien@utt.fr
;
Farouk Yalaoui
*
;
farouk.yalaoui@utt.fr
关键词:
Job shop scheduling
;
Availability constraint
;
Preventive maintenance
;
Mixed Integer Programming
;
Branch
;
bound
刊名:IFAC-PapersOnLine
出版年:2016
5.
A hybrid discrete optimization algorithm based on teaching-probabilistic learning mechanism for no-wait flow shop scheduling
作者:
Weishi Shao
a
;
shaoweishi@hotmail.com" class="auth_mail" title="E-mail the corresponding author
;
Dechang Pi
a
;
b
;
nuaacs@126.com" class="auth_mail" title="E-mail the corresponding author
;
Zhongshi Shao
a
;
shaozhongshi@hotmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Discrete teaching
;
Discrete probabilistic learning
;
Population reconstruction
;
Neighborhood search
;
No-wait flow shop scheduling
;
Minimization
of
makespan
刊名:Knowledge-Based Systems
出版年:2016
6.
On a generalized single machine scheduling problem with time-dependent processing times
*
作者:
Alexander A. Lazarev
*
;
jobmath@mail.ru" class="auth_mail" title="E-mail the corresponding author
;
Dmitry I. Arkhipov
**
;
miptrafter@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Frank Werner
***
;
frank.werner@ovgu.de" class="auth_mail" title="E-mail the corresponding author
关键词:
scheduling algorithms
;
single-machine scheduling
;
polynomial algorithms
;
makespan
;
Pareto set
刊名:IFAC-PapersOnLine
出版年:2016
7.
An Artificial Bee Colony Approach for Multi-objective Job Shop Scheduling
作者:
Abyson Scaria
a
;
Kiran George
b
;
Jobin Sebastian
a
;
jseb93@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Job Shop Scheduling Problem (JSSP)
;
Artificial Bee Colony (ABC)
;
Makespan
;
Tardiness.
刊名:Procedia Technology
出版年:2016
8.
Resource consumption
minimization
with a constraint
of
maximum tardiness on parallel machines
作者:
Zhaohui Liu
a
;
Wen-Chiung Lee
b
;
Jen-Ya Wang
c
;
jywang@sunrise.hk.edu.tw" class="auth_mail" title="E-mail the corresponding author
关键词:
Scheduling
;
Parallel machines
;
Makespan
;
Resource consumption
刊名:Computers & Industrial Engineering
出版年:2016
9.
Heuristics for solving flow shop scheduling problem under resources constraints
作者:
Imane Laribi
*
;
im.laribi@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Farouk Yalaoui
**
;
farouk.yalaoui@utt.fr" class="auth_mail" title="E-mail the corresponding author
;
Fayç
;
al Belkaid
*
;
f_belkaid@yahoo.fr" class="auth_mail" title="E-mail the corresponding author
;
Zaki Sari
***
;
z_sari@mail.univ-tlemcen.dz" class="auth_mail" title="E-mail the corresponding author
关键词:
Scheduling
;
flow shop
;
heuristics
;
no renewable resource
;
makespan
刊名:IFAC-PapersOnLine
出版年:2016
10.
Semi-online scheduling on a single machine with unexpected breakdown
作者:
Imed Kacem
a
;
imed.kacem@univ-lorraine.fr" class="auth_mail" title="E-mail the corresponding author
;
Hans Kellerer
b
;
hans.kellerer@uni-graz.at" class="auth_mail" title="E-mail the corresponding author
关键词:
Semi-online scheduling
;
Unexpected breakdown
;
Competitive analysis
刊名:Theoretical Computer Science
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(257)
题名(48)
关键词(14)
文摘(213)
按出版年细分(257)
2027年及以后(5)
2017年(2)
2016年(12)
2015年(4)
2013年(21)
2012年(22)
2011年(23)
2010年(29)
2009年(26)
2008年(23)
2007年(8)
2006年(13)
2005年(8)
2004年(17)
2003年(5)
2002年(7)
2001年(6)
2000年(2)
2000年及以前(24)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.