ON THE 2-PHASE METHOD FOR PREEMPTIVE SCHEDULING

被引：15

作者：

DEWERRA, D

机构：

[1] CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA

[2] BEIJING INST TECHNOL,SYST & CONTROL LAB,BEIJING,PEOPLES R CHINA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1988年 / 37卷 / 02期

关键词：

Mathematical Programming; Linear - Mathematical Techniques - Graph Theory - Production Control - Operations Research;

D O I：

10.1016/0377-2217(88)90332-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Preemptive scheduling problems on parallel processors may in some cases be solved by a two-phase method. First, solve a LP problem which will give the minimum total completion time T and the processing times of the jobs on the various processors. Second, construct a feasible schedule using T time units. Some extensions of this procedure are discussed. A general model for preemptive scheduling is described with a two-phase method for solving problems of this type.

引用

页码：227 / 235

页数：9

共 9 条

[1]

Berge C., 1983, GRAPHES

[2]

Blaewicz J., 1986, SCHEDULING RESOURCE

[3]

COCHAND M, 1986, OR8501 EC POL FED LA

[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 DECOMPOSITION PROPERTY OF POLYHEDRA [J].

DEWERRA, D .

MATHEMATICAL PROGRAMMING, 1984, 30 (03) :261-266

[6]

DEWERRA D, 1986, MATH PROGRAM STUD, V26, P197

[7]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[8]

SLOWINSKI R, 1981, RAIRO-INF-COMPUT SCI, V15, P155

[9]

SLOWINSKI R, 1987, CAHIERS LAMSADE, V74

← 1 →