A NOTE ON A PARTIAL SEARCH ALGORITHM FOR THE SINGLE-MACHINE OPTIMAL COMMON DUE-DATE ASSIGNMENT AND SEQUENCING PROBLEM

被引：9
作者：
CHENG, TCE [1 ]
机构：
[1] UNIV MANITOBA,FAC ENGN,WINNIPEG R3T 2N2,MANITOBA,CANADA
来源：
COMPUTERS & OPERATIONS RESEARCH | 1990年 / 17卷 / 03期
关键词：
D O I：
10.1016/0305-0548(90)90009-V
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs. © 1990.
引用
收藏
页码：321 / 324
页数：4
相关论文
共 5 条
[1]  
Baker K., 1974, INTRO SEQUENCING SCH
[2]   AN ALGORITHM FOR THE CON DUE-DATE DETERMINATION AND SEQUENCING PROBLEM [J].
CHENG, TCE .
COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (06) :537-542
[3]   SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].
CHENG, TCE ;
GUPTA, MC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166
[4]  
CHENG TCE, 1986, IMA J MATH MGMT, V1, P39
[5]  
HALL NG, 1989, WEIGHTED DEVIATION C
1