ANALYSIS OF A LINEARIZATION HEURISTIC FOR SINGLE-MACHINE SCHEDULING TO MAXIMIZE PROFIT

被引:17
作者
FISHER, ML
KRIEGER, AM
机构
关键词
D O I
10.1007/BF02612362
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:218 / 225
页数:8
相关论文
共 13 条
[1]  
[Anonymous], COMMUNICATION
[2]   FINDING AN OPTIMAL SEQUENCE BY DYNAMIC-PROGRAMMING - EXTENSION TO PRECEDENCE-RELATED TASKS [J].
BAKER, KR ;
SCHRAGE, LE .
OPERATIONS RESEARCH, 1978, 26 (01) :111-120
[3]  
Carroll D. C, 1965, THESIS MASSACHUSETTS
[4]   DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM [J].
FISHER, ML .
MATHEMATICAL PROGRAMMING, 1976, 11 (03) :229-251
[5]   WORST-CASE ANALYSIS OF HEURISTIC ALGORITHMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1980, 26 (01) :1-17
[6]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[7]  
FISHER ML, 1981, 810601 U PENNS WHART
[8]   BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].
GRAHAM, RL .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&
[9]  
KAN AHG, 1975, OPER RES, V23, P908
[10]  
Lawler E. L., 1977, ANN DISCRETE MATH, V1, P331, DOI [10.1016/S0167-5060(08)70742-8, DOI 10.1016/S0167-5060(08)70742-8]