ONE MACHINE SEQUENCING TO MINIMIZE MEAN FLOW TIME WITH MINIMUM NUMBER TARDY

被引:57
作者
EMMONS, H [1 ]
机构
[1] CASE WESTERN RESERVE UNIV,CLEVELAND,OH
关键词
Compendex;
D O I
10.1002/nav.3800220314
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Production control
引用
收藏
页码:585 / 592
页数:8
相关论文
共 9 条
[1]   EXPERIMENTAL COMPARISON OF SOLUTION ALGORITHMS FOR SINGLE-MACHINE TARDINESS PROBLEM [J].
BAKER, KR ;
MARTIN, JB .
NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :187-199
[2]  
Conway R, 1967, THEORY SCHEDULING
[3]   NOTE ON A SCHEDULING PROBLEM WITH DUAL CRITERIA [J].
EMMONS, H .
NAVAL RESEARCH LOGISTICS, 1975, 22 (03) :615-616
[4]  
EMMONS H, 1968, 51 CORN U DEP OP RES
[5]   EXTENSION OF A RESULT ON SCHEDULING WITH SECONDARY CRITERIA [J].
HECK, H ;
ROBERTS, S .
NAVAL RESEARCH LOGISTICS, 1972, 19 (02) :403-405
[6]   N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].
MOORE, JM .
MANAGEMENT SCIENCE, 1968, 15 (01) :102-109
[7]  
RINNOOYKAN AHG, BW3374 MATH CENTR RE
[8]  
SIDNEY JB, 1973, S THEORY SCHEDULING, P393
[9]  
Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106