ANALYSIS OF A HEURISTIC FOR ONE MACHINE SEQUENCING WITH RELEASE DATES AND DELIVERY TIMES

被引:161
作者
POTTS, CN
机构
关键词
D O I
10.1287/opre.28.6.1436
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:1436 / 1441
页数:6
相关论文
共 9 条
[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]  
Bricker P., 1977, ANN DISCRETE MATH, V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[3]  
FISHER ML, 1978, INTERFACES COMPUTER
[4]   PERFORMANCE GUARANTEES FOR SCHEDULING ALGORITHMS [J].
GAREY, MR ;
GRAHAM, RL ;
JOHNSON, DS .
OPERATIONS RESEARCH, 1978, 26 (01) :3-21
[5]  
KISE H, 1978, APPROXIMATE ALGORITH
[6]  
Kise H, 1978, MEM KYOTO TU SCI TEC, V27, P25
[7]  
Lageweg B.J., 1976, STAT NEERL, V30, P25
[8]   SCHEDULING WITH READY TIMES AND DUE DATES TO MINIMIZE MAXIMUM LATENESS [J].
MCMAHON, G ;
FLORIAN, M .
OPERATIONS RESEARCH, 1975, 23 (03) :475-482
[9]  
SCHRAGE L, UNPUBLISHED