SCHEDULING OF A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME SUBJECT TO RELEASE DATES

被引：56
作者：
BIANCO, L
RICCIARDELLI, S
机构：
来源：
NAVAL RESEARCH LOGISTICS | 1982年 / 29卷 / 01期
关键词：
D O I：
10.1002/nav.3800290114
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：151 / 167
页数：17
相关论文
共 15 条
[1]   SEQUENCING WITH DUE-DATES AND EARLY START TIMES TO MINIMIZE MAXIMUM TARDINESS [J].
BAKER, KR ;
SU, ZS .
NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :171-176
[2]  
BIANCO L, 1977, 8TH P IFIP C OPT TEC
[3]  
BIANCO L, 1979, CSSCCACNRR7936 U ROM
[4]  
BIANCO L, 1978, CSSCCACNRR7810 U ROM
[5]   SEQUENCING WITH EARLIEST STARTS AND DUE DATES WITH APPLICATION TO COMPUTING BOUNDS FOR (N/M/G/FMAX) PROBLEM [J].
BRATLEY, P ;
FLORIAN, M ;
ROBILLARD, P .
NAVAL RESEARCH LOGISTICS, 1973, 20 (01) :57-67
[6]  
Conway R, 1967, THEORY SCHEDULING
[7]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[8]   DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM [J].
FISHER, ML .
MATHEMATICAL PROGRAMMING, 1976, 11 (03) :229-251
[9]  
KAN AHG, 1975, OPER RES, V23, P908
[10]  
Lenstra J.K., 1977, COMPLEXITY MACHINE S
12