THE BASIC CYCLIC SCHEDULING PROBLEM WITH DEADLINES

被引：25

作者：

CHRETIENNE, P

机构：

来源：

DISCRETE APPLIED MATHEMATICS | 1991年 / 30卷 / 2-3期

关键词：

SCHEDULING; GRAPHS; ALGORITHMS; PERT;

D O I：

10.1016/0166-218X(91)90037-W

中图分类号：

O29 [应用数学];

学科分类号：

070104 [应用数学];

摘要：

The purpose of this paper is to study the latest schedule existence, calculation and properties of a basic cyclic scheduling problem with deadlines. First it is shown that, in the general case, a latest schedule exists but may be difficult to compute. Then we focus on a special case we call the optimal cyclic production problem. We derive an upper bound for the number of maximal-path values needed to compute the latest starting times and show the K-periodic structure of the latest starting time sequences.

引用

页码：109 / 123

页数：15

共 12 条

[1]

CARLIER J, IN PRESS ADV PETRI N

[2]

CARLIER J, 1984, ADV PETRI NETS, P62

[3]

CHRETIENNE P, 1984, RAIRO-RECH OPER, V18, P221

[4]

CHRETIENNE P, 1985, TSI-TECH SCI INF, V4, P127

[5]

CHRETIENNE P, 1983, THESIS P M CURIE U P

[6]

A LINEAR-SYSTEM-THEORETIC VIEW OF DISCRETE-EVENT PROCESSES AND ITS USE FOR PERFORMANCE EVALUATION IN MANUFACTURING [J].

COHEN, G ;

DUBOIS, D ;

QUADRAT, JP ;

VIOT, M .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1985, 30 (03) :210-220

[7]

HANEN C, 1987, 7TH P WORKSH APPL TH

[8]

HILLION H, IN PRESS IEEE T AUTO

[9]

KARP RM, 1978, DISCRETE MATH, V23, P309, DOI 10.1016/0012-365X(78)90011-0

[10]

SCHEDULING PERIODICALLY OCCURRING TASKS ON MULTIPLE PROCESSORS [J].

LAWLER, EL ;

MARTEL, CU .

INFORMATION PROCESSING LETTERS, 1981, 12 (01) :9-12

← 1 2 →