SEQUENCING JOBS ON A SINGLE-MACHINE WITH A COMMON DUE DATE AND STOCHASTIC PROCESSING TIMES

被引:29
作者
SARIN, SC
EREL, E
STEINER, G
机构
[1] BILKENT UNIV,DEPT MANAGEMENT,ANKARA,TURKEY
[2] MCMASTER UNIV,FAC BUSINESS,HAMILTON L8S 4L8,ONTARIO,CANADA
基金
加拿大自然科学与工程研究理事会;
关键词
STOCHASTIC SCHEDULING; SINGLE MACHINE;
D O I
10.1016/0377-2217(91)90249-U
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a procedure for sequencing jobs on a single machine with jobs having a common due date and stochastic processing times. The performance measure to be optimized is the expected incompletion cost. Job processing times are normally distributed random variables, and the variances of the processing times are proportional to their means. The optimal sequences are shown to have a W- or V-shape. Based on this property computationally attractive solution methods are presented.
引用
收藏
页码:188 / 198
页数:11
相关论文
共 11 条