EXPERIMENTAL COMPARISON OF SOLUTION ALGORITHMS FOR SINGLE-MACHINE TARDINESS PROBLEM

被引：38
作者：
BAKER, KR
MARTIN, JB
机构：
[1] N CAROLINA STATE UNIV,DEPT IND ENGN,GREENSBORO,NC
[2] UNIV MICHIGAN,DEPT IND & OPERATIONS ENGN,ANN ARBOR,MI
来源：
NAVAL RESEARCH LOGISTICS | 1974年 / 21卷 / 01期
关键词：
D O I：
10.1002/nav.3800210114
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：187 / 199
页数：13
相关论文
共 10 条
[1]  
Conway R, 1967, THEORY SCHEDULING
[2]  
ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105
[3]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[4]   A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].
HELD, M ;
KARP, RM .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210
[5]  
IGNIZIO JP, 1971, B TIMS, V2
[6]  
LAWLER EL, 1963, MANAGE SCI, V9, P280
[7]  
MONTAGNE ER, 1969, 5 AR STAT U IND ENG, P20
[8]  
SHWIMER J, 1972, MANAGE SCI, V18, P301
[9]   HYBRID ALGORITHM FOR ONE MACHINE SEQUENCING PROBLEM TO MINIMIZE TOTAL TARDINESS [J].
SRINIVASAN, V .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03) :317-+
[10]  
Wilkerson L.J., 1971, AIIE T, V3, P239, DOI DOI 10.1080/05695557108974812
1