SINGLE MACHINE PROBLEM WITH QUADRATIC PENALTY FUNCTION OF COMPLETION TIMES - BRANCH-AND-BOUND SOLUTION

被引:129
作者
TOWNSEND, W
机构
关键词
D O I
10.1287/mnsc.24.5.530
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:530 / 534
页数:5
相关论文
共 9 条
[1]  
ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105
[2]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[3]   OPTIMAL SEQUENCING OF A SINGLE MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS [J].
LAWLER, EL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (05) :544-546
[4]   SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].
MCNAUGHTON, R .
MANAGEMENT SCIENCE, 1959, 6 (01) :1-12
[5]   N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].
MOORE, JM .
MANAGEMENT SCIENCE, 1968, 15 (01) :102-109
[6]   SCHEDULING TASKS WITH DEADLINES AND NON-LINEAR LOSS FUNCTIONS [J].
SCHILD, A ;
FREDMAN, IJ .
MANAGEMENT SCIENCE, 1962, 9 (01) :73-81
[7]  
SHWIMER J, 1972, MANAGE SCI, V18, P301
[8]  
Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106
[9]   HYBRID ALGORITHM FOR ONE MACHINE SEQUENCING PROBLEM TO MINIMIZE TOTAL TARDINESS [J].
SRINIVASAN, V .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03) :317-+