Minimizing makespan on a single machine subject to random breakdowns

被引：18
作者：
Kasap, N
Aytug, H [1 ]
Paul, A
机构：
[1] Univ Florida, Warrington Coll Business Adm, Gainesville, FL 32611 USA
[2] Sabanci Univ, Grad Sch Management, Istanbul, Turkey
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 01期
基金：
美国国家科学基金会;
关键词：
sequencing; stochastic scheduling; expected makespan; unreliable machine;
D O I：
10.1016/j.orl.2005.02.002
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：29 / 36
页数：8
相关论文
共 50 条
12345