ON SINGLE-MACHINE SCHEDULING WITH PRECEDENCE RELATIONS AND LINEAR OR DISCOUNTED COSTS

被引：19

作者：

GLAZEBROOK, KD ^{[1
]}

GITTINS, JC ^{[1
]}

机构：

[1] UNIV OXFORD,OXFORD,ENGLAND

来源：

OPERATIONS RESEARCH | 1981年 / 29卷 / 01期

关键词：

D O I：

10.1287/opre.29.1.161

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Some results of J. B. Sidney concerning order-constrained deterministic scheduling with linear costs are extended to the more complex discounted costs case. Further, certain order-constrained stochastic scheduling problems are shown to have optimal strategies which are nonpreemptive. When this is so, results for the deterministic case may be utilized to obtain these optimal strategies. The models discussed are of interest in computer and jobshop scheduling and research planning.

引用

页码：161 / 173

页数：13

共 13 条

[1]

[Anonymous], 1973, DISCRETE MATH

[2]

Bruno J., 1975, SIAM Journal on Computing, V4, P478, DOI 10.1137/0204041

[3]

GITTINS JC, 1979, J ROY STAT SOC B MET, V41, P148

[4]

GITTINS JC, UNPUBLISHED