Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs

被引：0

作者：

Cai, Xiaoqiang ^{[1
]}

Zhou, Sean ^{[2
]}

机构：

[1] Chinese University of Hong Kong, Shatin, Hong Kong

[2] Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

来源：

Operations Research | / 47卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：422 / 437

共 50 条

[21] Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs
Toksari, M. Duran
Guner, Ertan
JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (06) : 843 - 851
[22] Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs
M. Duran Toksarı
Ertan Güner
Journal of Intelligent Manufacturing, 2010, 21 : 843 - 851
[23] SCHEDULING JOBS WITH STOCHASTICALLY ORDERED PROCESSING TIMES ON PARALLEL MACHINES TO MINIMIZE EXPECTED FLOWTIME
WEBER, RR
VARAIYA, P
WALRAND, J
JOURNAL OF APPLIED PROBABILITY, 1986, 23 (03) : 841 - 847
[24] SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS ON PARALLEL MACHINES TO MINIMIZE MAKESPAN OR FLOWTIME
WEBER, RR
JOURNAL OF APPLIED PROBABILITY, 1982, 19 (01) : 167 - 182
[25] Stochastic Single Machine Scheduling to Minimize the Weighted Number of Tardy Jobs
Li, Yang
Chen, Rongxi
FUZZY INFORMATION AND ENGINEERING 2010, VOL 1, 2010, 78 : 363 - +
[26] SCHEDULING STOCHASTIC JOBS ON A SINGLE-MACHINE SUBJECT TO BREAKDOWNS
GLAZEBROOK, KD
NAVAL RESEARCH LOGISTICS, 1984, 31 (02) : 251 - 264
[27] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Köksalan, M
Kondak, S
RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING, 2000, 487 : 381 - 387
[28] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Koksalan, M
Koksalan, SK
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 661 - 664
[29] SCHEDULING JOBS WITH STOCHASTICALLY ORDERED PROCESSING TIMES ON PARALLEL MACHINES TO MINIMIZE EXPECTED FLOWTIME.
Weber, R.R.
Varaiya, P.
Walrand, J.
1600, (23):
[30] Scheduling two-point stochastic jobs to minimize the makespan on two parallel machines
Borst, S
Bruno, J
Coffman, EG
Phillips, S
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1997, 11 (01) : 95 - 105

← 1 2 3 4 5 →