THE PARALLEL-MACHINE COMMON DUE-DATE ASSIGNMENT AND SCHEDULING PROBLEM IS NP-HARD

被引：0

作者：

CHENG, TCE

KAHLBACHER, HG

机构：

[1] UNIV KAISERSLAUTERN,FAC MATH,W-6750 KAISERSLAUTERN,GERMANY

[2] UNIV MANITOBA,DEPT ACTUARIAL & MANAGEMENT SCI,WINNIPEG R3T 2N2,MANITOBA,CANADA

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 9卷 / 02期

关键词：

DUE-DATE ASSIGNMENT; SCHEDULING; SEQUENCING; NP-HARDNESS;

D O I：

暂无

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In a recent paper, Cheng (1989) studied the problem of assigning a common due-date to a set of simultaneously available jobs and scheduling them on several parallel and identical machines to minimize the costs of due-date assignment, job earliness and tardiness. In this note, we present a proof that the problem is NP-hard and thus the use of heuristic solution methods can be justified.

引用

页码：235 / 238

页数：4

共 50 条

[41] Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
Iranpoor, Mehdi
Ghomi, S. M. T. Fatemi
Zandieh, M.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 1100 - 1108
[42] Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment
Ji, Min
Zhang, Wenya
Liao, Lijuan
Cheng, T. C. E.
Tan, Yuanyuan
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (06) : 1667 - 1684
[43] MINIMIZING TOTAL PENALTY FOR THE SINGLE-MACHINE DUE-DATE ASSIGNMENT AND SEQUENCING PROBLEM
CHENG, TCE
OGUZ, C
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1994, 11 (01) : 19 - 30
[44] The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration
Toksari, M. Duran
Guner, Ertan
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (01) : 92 - 112
[45] Common due date assignment and cumulative deterioration scheduling on a single machine
Li, Shi-Sheng
Chen, Ren-Xia
[J]. ENGINEERING OPTIMIZATION, 2017, 49 (06) : 976 - 989
[46] Batch scheduling with deadlines on parallel machines: An NP-hard case
Kovalyov, MY
Shafransky, YM
[J]. INFORMATION PROCESSING LETTERS, 1997, 64 (02) : 69 - 74
[47] AN ALGORITHM FOR THE N/M PARALLEL C MAX PREEMPTIVE DUE-DATE SCHEDULING PROBLEM
CHENG, TCE
SIN, CCS
[J]. ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1991, 21 (01): : 43 - 49
[48] A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects
Kuo, W-H
Yang, D-L
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (01) : 206 - 210
[49] Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
Suh-Jenq Yang
Chou-Jung Hsu
Dar-Li Yang
[J]. Optimization Letters, 2012, 6 : 1855 - 1873
[50] Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
Yang, Suh-Jenq
Hsu, Chou-Jung
Yang, Dar-Li
[J]. OPTIMIZATION LETTERS, 2012, 6 (08) : 1855 - 1873

← 1 2 3 4 5 →