SCHEDULING JOBS WITH FIXED START AND END TIMES

被引：217

作者：

ARKIN, EM

SILVERBERG, EB

机构：

[1] Department of Operations Research, Stanford University, Stanford, CA 94305, United States

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 18卷 / 01期

基金：

美国国家科学基金会;

关键词：

GRAPH COLORING - INTERVAL GRAPHS - JOB SCHEDULING - NP-COMPLETE - PERFECT GRAPHS;

D O I：

10.1016/0166-218X(87)90037-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：1 / 8

页数：8

共 13 条

[1]

Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390

[2] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[3] ON CHAIN AND ANTI-CHAIN FAMILIES OF A PARTIALLY ORDERED SET [J].

FRANK, A .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 29 (02) :176-184

[4]

FREDMAN ML, 1984, 25TH P IEEE S F COMP

[5]

Garey MR., 1979, COMPUTERS INTRACTABI

[6]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[7] STRUCTURE OF SPERNER K-FAMILIES [J].

GREENE, C ;

KLEITMAN, DJ .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (01) :41-68

[8]

KHACHIIAN LG, 1979, DOKL AKAD NAUK SSSR+, V244, P1093

[9]

KOLEN AWJ, UNPUB INTERVAL SCHED

[10]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

← 1 2 →