A NOTE ON THE COMPLEXITY OF OPENSHOP SCHEDULING PROBLEMS

被引：0

作者：

KUBIAK, W

SRISKANDARAJAH, C

ZARAS, K

机构：

来源：

INFOR | 1991年 / 29卷 / 04期

关键词：

OPENSHOP SCHEDULING; FINISH TIME; MEAN FLOW TIME; TOTAL WEIGHTED TARDINESS; MAXIMUM LATENESS; NUMBER OF LATE JOBS; NP-HARD; NP-COMPLETE;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

We investigate the complexity of openshop scheduling problems. A number of variations of the shop with different objective functions have been surveyed. The problem of minimizing mean flow time in no-wait openshop as well as the problem of minimizing the number of late jobs for preemptive schedules are shown to be NP-hard. An O(n log n) time algorithm for minimizing the total weighted number of late jobs in no-wait openshop is provided.

引用

页码：284 / 294

页数：11

共 50 条

[31] A NOTE ON THE GENERALIZED DUE DATES SCHEDULING PROBLEMS
SRISKANDARAJAH, C
[J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (04) : 587 - 597
[32] A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING"
Wu, Yu-Bin
Huang, Xue
Li, Lin
Ji, Ping
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (03)
[33] A NOTE ON THE INFLUENCE OF MISSING OPERATIONS ON SCHEDULING PROBLEMS
HEFETZ, N
ADIRI, I
[J]. NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 535 - 539
[34] A note on scheduling problems arising in satellite communications
Jain, R
Werth, J
Browne, JC
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (01) : 100 - 102
[35] A heuristic for the two-machine no-wait openshop scheduling problem
Sidney, JB
Sriskandarajah, C
[J]. NAVAL RESEARCH LOGISTICS, 1999, 46 (02) : 129 - 145
[36] A note on the complexity of flow-shop scheduling with deteriorating jobs
Thornblad, Karin
Patriksson, Michael
[J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 251 - 253
[37] A note on the complexity of scheduling for precedence constrained messages in distributed systems
Goda, K
Yamada, T
Ueno, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (04) : 1090 - 1092
[38] A note on the complexity of family scheduling to minimize the number of late jobs
Cheng, TCE
Liu, ZH
Shafransky, YM
[J]. JOURNAL OF SCHEDULING, 2001, 4 (04) : 225 - 229
[39] Two machine openshop scheduling with machine-dependent processing times
Vakharia, AJ
Catay, B
[J]. DISCRETE APPLIED MATHEMATICS, 1997, 73 (03) : 283 - 288
[40] A Framework for the Complexity of High-Multiplicity Scheduling Problems
N. Brauner
Y. Crama
A. Grigoriev
J. van de Klundert
[J]. Journal of Combinatorial Optimization, 2005, 9 : 313 - 323

← 1 2 3 4 5 →