Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling [PDF]
Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Yang, S +3 more
core +1 more source
Computational Intelligence for Estimating Cost of New Product Development
This paper is concerned with estimating cost of various new product development phases with the use of computational intelligence techniques such as neural networks and fuzzy neural system. Companies tend to develop many new products simultaneously and a
Relich Marcin
doaj +1 more source
09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Krokhin, Andrei +3 more
core +1 more source
Automated static symmetry breaking in constraint satisfaction problems [PDF]
Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core +2 more sources
M-best solutions for a class of fuzzy constraint satisfaction problems
The article considers one of the possible generalizations of constraint satisfaction problems where relations are replaced by multivalued membership functions. In this case operations of disjunction and conjunction are replaced by maximum and minimum, and consistency of a solution becomes multivalued rather than binary.
Michail I. Schlesinger +2 more
openaire +2 more sources
09441 Executive Summary – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
The seminar brought together forty researchers from di®erent highly advanced areas of constraint satisfaction and with complementary ex- pertise (logical, algebraic, combinatorial, probabilistic aspects). The list of participants contained both senior
Krokhin, Andrei +3 more
core +1 more source
Spread-Repair Algorithm for Solving Extended Fuzzy Constraint Satisfaction Problems [PDF]
In this paper, we propose a new type of FCSPs called hybrid domain FCSPs that have a mixture of discrete and continuous domains. To solve this type of problems, we present an algorithm called Spread-Repair based on the framework of iterative improvement.
Yasuhiro Sudo +2 more
openaire +2 more sources
The requirement quality affects product development at all lifecycle stages, as well as the end product. Poorly defined requirements bring to extended deadlines, increased financial costs, even to project disruption. Current researches related to the good quality of requirements include characteristics of good requirements and the development of new ...
Radomir Prodanović +3 more
openaire +2 more sources
in Different Levels and Solving by ε-Constraint Approach [PDF]
Nowadays, due to the huge effects of designing the supply network on the economic interests of organizations, the quality of providing appropriate services and customer satisfaction, the problem of network design is one of the most interesting and ...
Fatemeh Fazeli, Masoud Seidi
doaj
Constraint Satisfaction Problems over Numeric Domains [PDF]
We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers.
Mamino, Marcello, Bodirsky, Manuel
core +1 more source

