COST-MINIMAL PREEMPTIVE SCHEDULING OF INDEPENDENT JOBS WITH RELEASE DUE DATES ON OPEN SHOP UNDER RESOURCE CONSTRAINTS

被引：3

作者：

SLOWINSKI, R

机构：

[1] Institute of Control Engineering, Technical University of Poznań

来源：

INFORMATION PROCESSING LETTERS | 1979年 / 9卷 / 05期

关键词：

cost minimization; Open shop; preemptive schedule; renewable and non-renewable resources; resource allocation;

D O I：

10.1016/0020-0190(79)90076-0

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：233 / 237

页数：5

共 6 条

[1]

Cho, Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Technical Report 78-5, (1978)

[2]

Gonzales, A note on open shop preemptive schedules, Technical Report 214, (1976)

[3]

Gonzales, Sahni, Open shop scheduling to minimize finish time, Journal of the ACM, 23, pp. 665-679, (1976)

[4]

Graham, Lawler, Lenstra, Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Report BW 82⧸77, (1977)

[5]

Slowinski, Scheduling preemptable tasks on unrelated processors with additional resources to minimize schedule lentgh, Lecture Notes in Computer Science, 65, (1978)

[6]

Slowinski, Allocation de ressources limitées parmi des tâches exécutées par un ensemble de machines indépendantes, Comparison of Automatic Control and Operational Research Techniques Applied to Large Systems Analysis and Control, (1979)

← 1 →