Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

被引：6

作者：

Shioura, Akiyoshi ^{[1
]}

Shakhlevich, Natalia V. ^{[2
]}

Strusevich, Vitaly A. ^{[3
]}

机构：

[1] Tokyo Inst Technol, Dept Ind Engn & Econ, Tokyo 1528550, Japan

[2] Univ Leeds, Sch Comp, Leeds LS2 9JT, W Yorkshire, England

[3] Univ Greenwich, Old Royal Naval Coll, Dept Math Sci, Pk Row, London SE10 9LS, England

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 2020年 / 76卷 / 03期

基金：

英国工程与自然科学研究理事会;

关键词：

Scheduling; Single machine; Parallel machines; Controllable processing times; SUBMODULAR OPTIMIZATION; IMPRECISE COMPUTATION; ALGORITHM; SUBJECT;

D O I：

10.1007/s10898-018-0686-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times. The objective is to minimize the maximum compression cost. We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times.

引用

页码：471 / 490

页数：20

共 31 条

[1] THE NUMBER OF SMALL SEMISPACES OF A FINITE-SET OF POINTS IN THE PLANE [J].