Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,553 papers from all fields of science
Search
Sign In
Create Free Account
Strong NP-completeness
Known as:
Strongly NP-complete
, Strongly NP-hard
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Computational complexity theory
Dynamic programming
Pseudo-polynomial time
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
A. Kel'manov
,
A. Motkova
International Conference on Discrete Optimization…
2016
Corpus ID: 22034703
We consider the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters so as to minimize the sum…
Expand
2014
2014
Single machine just‐in‐time scheduling problems with two competing agents
Enrique Gerstl
,
G. Mosheiov
2014
Corpus ID: 60666577
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own…
Expand
2013
2013
Optimizing Bicriteria Flow Shop Scheduling Problem by Simulated Annealing Algorithm
Pempera Jaroslaw
,
Smutnicki Czeslaw
,
Żelazny Dominik
International Conference on Conceptual Structures
2013
Corpus ID: 195714663
2012
2012
Maximum Multicommodity Flows over Time without Intermediate Storage
Martin Groß
,
M. Skutella
Embedded Systems and Applications
2012
Corpus ID: 45420911
Flows over time generalize classical "static" network flows by introducing a temporal dimension. They can thus be used to model…
Expand
2010
2010
Author ' s personal copy Discrete Optimization Scheduling multiple orders per job in a single machine to minimize total completion time
S. Mason
,
Jen-Shiang Chen
2010
Corpus ID: 10874343
This paper deals with a single-machine scheduling problem with multiple orders per job (MOJ) considerations. Both lot processing…
Expand
Highly Cited
2004
Highly Cited
2004
A robust simulated annealing heuristic for flow shop scheduling problems
C. Low
,
J. Yeh
,
Kai Huang
2004
Corpus ID: 57707567
The flow-shop scheduling problem is one of the most well-known problems in the area of scheduling. The objective of minimising…
Expand
Highly Cited
2003
Highly Cited
2003
Flow shop scheduling problem with limited machine availability: A heuristic approach
R. Aggoune
,
M. Portmann
2003
Corpus ID: 62204641
2002
2002
Local search algorithms for the min-max loop layout problem
JA Bennell
,
CN Potts
,
JD Whitehead
Journal of the Operational Research Society
2002
Corpus ID: 120312165
In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines…
Expand
2000
2000
Scheduling multiprocessor tasks for mean flow time criterion
M. Drozdowski
,
P. Dell’Olmo
Computers & Operations Research
2000
Corpus ID: 2528038
1999
1999
Multiple bottleneck assignment problem
Y. Aneja
,
Abraham P. Punnen
European Journal of Operational Research
1999
Corpus ID: 28239715
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE