SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR N/M/I/LMAX AND N/2/F/LMAX SCHEDULING PROBLEMS

被引：6

作者：

MASUDA, T ^{[1
]}

ISHII, H ^{[1
]}

NISHIDA, T ^{[1
]}

机构：

[1] OSAKA UNIV,OSAKA,JAPAN

来源：

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 1983年 / 26卷 / 03期

关键词：

D O I：

10.15807/jorsj.26.212

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：212 / 225

页数：14

共 6 条

[1]

Graham R. L., 1979, Discrete Optimisation, P287

[2]

Jackson J. R., 1955, 43 U CAL MAN SCI RES

[3]

Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]

[4] PERFORMANCE ANALYSIS OF 6 APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES [J].

KISE, H ;

IBARAKI, T ;

MINE, H .

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1979, 22 (03) :205-224

[5] OPTIMAL SEQUENCING OF A SINGLE MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS [J].

LAWLER, EL .

MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (05) :544-546

[6]

Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

← 1 →