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 条

[1] Polynomially solvable total tardiness problems: Review and extensions
Koulamas, C
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1997, 25 (02): : 237 - 241
[2] THE TOTAL TARDINESS PROBLEM - REVIEW AND EXTENSIONS
KOULAMAS, C
OPERATIONS RESEARCH, 1994, 42 (06) : 1025 - 1041
[3] POLYNOMIALLY SOLVABLE SATISFIABILITY PROBLEMS
GALLO, G
SCUTELLA, MG
INFORMATION PROCESSING LETTERS, 1988, 29 (05) : 221 - 227
[4] Polynomially solvable personnel rostering problems
Smet, Pieter
Brucker, Peter
De Causmaecker, Patrick
Vanden Berghe, Greet
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (01) : 67 - 75
[5] Hierarchies of polynomially solvable satisfiability problems
Pretolani, D
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1996, 17 (3-4) : 339 - 357
[6] A class of polynomially solvable linear complementarity problems
Teresa H. Chu
Mathematical Programming, 2006, 107 : 461 - 470
[7] A class of polynomially solvable linear complementarity problems
Chu, TH
MATHEMATICAL PROGRAMMING, 2006, 107 (03) : 461 - 470
[8] ONLINE ALGORITHMS FOR POLYNOMIALLY SOLVABLE SATISFIABILITY PROBLEMS
AUSIELLO, G
ITALIANO, GF
JOURNAL OF LOGIC PROGRAMMING, 1991, 10 (01): : 69 - 90
[9] The single-machine total tardiness scheduling problem: Review and extensions
Koulamas, Christos
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) : 1 - 7
[10] A polynomially solvable class of quadratic semi-assignment problems
Malucelli, F
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 91 (03) : 619 - 622

← 1 2 3 4 5 →