A Fuzzy-Neural Ensemble and Geometric Rule Fusion Approach for Scheduling a Wafer Fabrication Factory

Table 1

The complexity of a decision problem.

Complexity	Meaning
P	A decision problem that is polynomial solvable.
NP	A decision problem that can be verified by a polynomial algorithm if a proper clue is given.
NP-hard	A decision problem P is called NP-hard if the entire class NP polynomially reduces to problem P.
NP-complete	A decision problem P is called NP-complete if it is both in classes NP and NP-hard.