SOME PREEMPTIVE OPEN SHOP SCHEDULING PROBLEMS WITH A RENEWABLE OR A NONRENEWABLE RESOURCE

被引：12

作者：

DEWERRA, D ^{[1
]}

BLAZEWICZ, J ^{[1
]}

机构：

[1] POLYTECH POZNANSKA,INST INFORMAT,POZNAN,POLAND

来源：

DISCRETE APPLIED MATHEMATICS | 1992年 / 35卷 / 03期

关键词：

EDGE COLORING; OPEN SHOP PREEMPTIVE SCHEDULE; RENEWABLE AND NONRENEWABLE RESOURCE;

D O I：

10.1016/0166-218X(92)90245-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An edge coloring model is presented for a preemptive open shop problem. Constraints generated by a single resource have to be taken into account. The case of a renewable and of a nonrenewable resource as considered. Since the existence of a schedule is an NP-complete problem in both cases we present some cases which are solvable in polynomial time.

引用

页码：205 / 219

页数：15

共 10 条

[1]

Berge C., 1983, GRAPHES

[2]

Blazewicz J., 1986, ANN OPER RES, V7

[3]

Cochand M., 1989, ZOR, Methods and Models of Operations Research, V33, P297, DOI 10.1007/BF01416077

[4] PREEMPTIVE SCHEDULING, LINEAR-PROGRAMMING AND NETWORK FLOWS [J].

DEWERRA, D .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (01) :11-20

[5] A PREEMPTIVE OPEN SHOP SCHEDULING PROBLEM WITH ONE RESOURCE [J].

DEWERRA, D ;

BLAZEWICZ, J ;

KUBIAK, W .

OPERATIONS RESEARCH LETTERS, 1991, 10 (01) :9-15

[6]

DEWERRA D, 1971, DISCRETE MATH, V1, P167

[7]

Folkman J., 1969, COMBINATORIAL MATH I, P561

[8]

Ford L., 1962, FLOWS NETWORKS, V71, P1059, DOI 10.2307/2311955

[9]

GABOW H, UNPUB ALGORITHMS EDG

[10]

Lawler E. L., 1976, COMBINATORIAL OPTIMI

← 1 →