AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM

被引:9
作者
KISE, H [1 ]
SHIOMI, A [1 ]
UNO, M [1 ]
CHAO, DS [1 ]
机构
[1] KYOTO INST TECHNOL,FAC ENGN,DEPT MECH ENGN,SAKYO KU,KYOTO 606,JAPAN
关键词
D O I
10.15807/jorsj.25.193
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:193 / 204
页数:12
相关论文
共 10 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
BALUT LSJ, 1973, MANAGEMENT SCI, V19, P1283
[3]  
Ibaraki T., 1976, Transactions of the Institute of Electronics and Communication Engineers of Japan, Section E (English), VE59, P1
[4]  
JACKSON JR, 1955, UCLA43 RES REP
[5]  
Karp R.M., 1972, COMPLEXITY COMPUTER
[6]   SOLVABLE CASE OF ONE-MACHINE SCHEDULING PROBLEM WITH READY AND DUE TIMES [J].
KISE, H ;
IBARAKI, T ;
MINE, H .
OPERATIONS RESEARCH, 1978, 26 (01) :121-126
[7]  
KISE H, 1981, UNPUB MANAGEMENT SCI
[8]  
LAWLER EL, 1976, REV FR AUTOMAT INFOR, V10, P27
[9]   N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].
MOORE, JM .
MANAGEMENT SCIENCE, 1968, 15 (01) :102-109
[10]  
SIDNEY JB, 1970, 86 S THEOR SCHED ITS