MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE

被引:123
|
作者
BAGCHI, U [1 ]
SULLIVAN, RS [1 ]
CHANG, YL [1 ]
机构
[1] OHIO STATE UNIV,COLUMBUS,OH 43210
关键词
COMPUTER PROGRAMMING - Algorithms - OPTIMIZATION;
D O I
10.1002/nav.3800330206
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem.
引用
收藏
页码:227 / 240
页数:14
相关论文
共 50 条