APPLICATION OF SEQUENCING POLICIES TO TELEPHONE SWITCHING FACILITIES

被引：3

作者：

ACKERMAN, LJ

LUSS, H

BERKOWITZ, RS

机构：

[1] UNIV PENN,MOORE SCH ELECT ENGN,PHILADELPHIA,PA 19174

[2] BELL TEL LABS INC,DEPT OPERAT RES PROJECTS,HOLMDEL,NJ 07733

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1977年 / 7卷 / 08期

关键词：

D O I：

10.1109/TSMC.1977.4309786

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：604 / 609

页数：6

共 11 条

[1]

ACKERMAN LJ, 1976, THESIS U PENNSYLVANI

[2]

BAKER KR, 1976, 170 DUK U GRAD SCH B

[3] DYNAMIC-PROGRAMMING APPROACH TO SELECTION AND TIMING OF GENERATION-PLANT ADDITIONS [J].

DALE, KM .

PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1966, 113 (05) :803-&

[4] SEQUENCING EXPANSION PROJECTS [J].

ERLENKOTTER, D .

OPERATIONS RESEARCH, 1973, 21 (02) :542-553

[5]

GARFINKEL RS, 1972, INTEGER PROGRAMMING, P77

[6] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[7] THE MAXIMUM CAPACITY ROUTE PROBLEM [J].

HU, TC .

OPERATIONS RESEARCH, 1961, 9 (06) :898-900

[8]

RITCHIE AE, 1974, P INT SWITCHING S IE

[9] ON SCHEDULING TASKS WITH ASSOCIATED LINEAR LOSS FUNCTIONS [J].

SCHILD, A ;

FREDMAN, IJ .

MANAGEMENT SCIENCE, 1961, 7 (03) :280-285

[10] HYBRID ALGORITHM FOR ONE MACHINE SEQUENCING PROBLEM TO MINIMIZE TOTAL TARDINESS [J].

SRINIVASAN, V .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03) :317-+

← 1 2 →