Polynomially solvable total tardiness problems: Review and extensions

被引：0

作者：

Koulamas, C. ^{[1
,2
]}

机构：

[1] Florida International University, Miami, FL, United States

[2] Dept. of Decis. Sci. and Info S., Florida International University, University Park Campus, Miami, FL 33199, United States

来源：

Omega | 1997年 / 25卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：235 / 239

共 50 条

[21] A CLASS OF COMBINATORIAL PROBLEMS WITH POLYNOMIALLY SOLVABLE LARGE-SCALE SET COVERING PARTITIONING RELAXATIONS
MINOUX, M
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1987, 21 (02): : 105 - 136
[22] An investigation on single machine total weighted tardiness scheduling problems
Ponnambalam, S.G. (sgponnambalam@yahoo.com), 1600, Springer-Verlag London Ltd (22): : 3 - 4
[23] Single machine total tardiness maximization problems: complexity and algorithms
Evgeny R. Gafarov
Alexander A. Lazarev
Frank Werner
Annals of Operations Research, 2013, 207 : 121 - 136
[24] Tabu search for total tardiness minimization in flowshop scheduling problems
Armentano, VA
Ronconi, DP
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (03) : 219 - 235
[25] An investigation on single machine total weighted tardiness scheduling problems
R. Maheswaran
S. G. Ponnambalam
The International Journal of Advanced Manufacturing Technology, 2003, 22 : 243 - 248
[26] An investigation on single machine total weighted tardiness scheduling problems
Maheswaran, R
Ponnambalam, SG
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2003, 22 (3-4): : 243 - 248
[27] Single machine total tardiness maximization problems: complexity and algorithms
Gafarov, Evgeny R.
Lazarev, Alexander A.
Werner, Frank
ANNALS OF OPERATIONS RESEARCH, 2013, 207 (01) : 121 - 136
[28] DEADLOCKS AND TRAPS IN PETRI NETS AS HORN-SATISFIABILITY SOLUTIONS AND SOME RELATED POLYNOMIALLY SOLVABLE PROBLEMS
MINOUX, M
BARKAOUI, K
DISCRETE APPLIED MATHEMATICS, 1990, 29 (2-3) : 195 - 210
[29] On the Polynomially Solvable Problem of Designing Behavior of the Intelligent Robot
O. V. German
D. V. Semeryuk
Automation and Remote Control, 2001, 62 : 181 - 189
[30] POLYNOMIALLY SOLVABLE CASES FOR THE MAXIMUM STABLE SET PROBLEM
HERTZ, A
DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 195 - 210

← 1 2 3 4 5 →