Integer preemptive scheduling on parallel machines

被引：5

作者：

Baptiste, Ph ^{[2
,3
]}

Carlier, J. ^{[2
]}

Kononov, A. ^{[4
]}

Queyranne, M. ^{[5
]}

Sevastyanov, S. ^{[4
]}

Sviridenko, M. ^{[1
]}

机构：

[1] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England

[2] Univ Tech Compiegne, Heudiasyc, CNRS, Compiegne, France

[3] Ecole Polytech, F-91128 Palaiseau, France

[4] Sobolev Inst Math, Novosibirsk, Russia

[5] Univ British Columbia, Fac Commerce & Business Adm, Vancouver, BC V6T 1Z2, Canada

来源：

OPERATIONS RESEARCH LETTERS | 2012年 / 40卷 / 06期

基金：

俄罗斯基础研究基金会;

关键词：

Preemptive scheduling; Parallel machines; Structural properties; TIME;

D O I：

10.1016/j.orl.2012.06.011

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function (e.g. total weighted tardiness and total weighted number of late jobs) has the following integer preemption property: for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting and completion times of jobs) occur at integer time points. (c) 2012 Published by Elsevier B.V.

引用

页码：440 / 444

页数：5

共 50 条

[1] PREEMPTIVE SCHEDULING OF HYBRID PARALLEL MACHINES
BALAKRISHNAN, A
[J]. OPERATIONS RESEARCH, 1989, 37 (02) : 301 - 313
[2] A PARALLEL ALGORITHM FOR PREEMPTIVE SCHEDULING OF UNIFORM MACHINES
MARTEL, CU
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1988, 5 (06) : 700 - 715
[3] Preemptive and non-preemptive scheduling on two unrelated parallel machines
Soper, Alan J.
Strusevich, Vitaly A.
[J]. JOURNAL OF SCHEDULING, 2022, 25 (06) : 659 - 674
[4] Preemptive and non-preemptive scheduling on two unrelated parallel machines
Alan J. Soper
Vitaly A. Strusevich
[J]. Journal of Scheduling, 2022, 25 : 659 - 674
[5] Preemptive scheduling on identical parallel machines subject to deadlines
Azizoglu, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 148 (01) : 205 - 210
[6] Scheduling preemptive jobs with precedence constraints on parallel machines
Djellab, K
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 117 (02) : 355 - 367
[7] PREEMPTIVE SCHEDULING OF INDEPENDENT TASKS ON UNIFORM MACHINES IN PARALLEL
DEKEL, E
SHYU, CH
[J]. COMPUTING AND INFORMATION, 1989, : 139 - 145
[8] Complexity of preemptive minsum scheduling on unrelated parallel machines
Sitters, R
[J]. JOURNAL OF ALGORITHMS, 2005, 57 (01) : 37 - 48
[9] Preemptive scheduling on two parallel machines with a single server
Jiang, Yiwei
Dong, Jianming
Ji, Min
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 66 (02) : 514 - 518
[10] Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
Zurowski, Marcin
[J]. OPERATIONS RESEARCH PROCEEDINGS 2017, 2018, : 587 - 592

← 1 2 3 4 5 →