2008
DOI: 10.1016/j.engappai.2008.03.006
|View full text |Cite
|
Sign up to set email alerts
|

Feasible distributed CSP models for scheduling problems

Abstract: Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers assume for simplicity that each agent has exactly one variable. For real planning and scheduling problems, these distributed techniques require a large amount of messages passed among agents, so these problems are very difficult to solve. In this paper, we present a general distrib… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…Our research is completing this list, by showing how CSP can be involved in a negotiation process with two phases in order to obtain the best, as well as reliable decisions about formation of holarchies. Application of CSP for real manufacturing problems still reveals certain open problems [16]; between them, the issue of expressing manufacturing scenarios according to CSP formalism is to be mentioned, this being addressed by our paper.…”
Section: Related Work; Proposed Research Goalsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our research is completing this list, by showing how CSP can be involved in a negotiation process with two phases in order to obtain the best, as well as reliable decisions about formation of holarchies. Application of CSP for real manufacturing problems still reveals certain open problems [16]; between them, the issue of expressing manufacturing scenarios according to CSP formalism is to be mentioned, this being addressed by our paper.…”
Section: Related Work; Proposed Research Goalsmentioning
confidence: 99%
“…DisCSP was used for resource allocation problems, even in HMSs [16,18]. Besides the method of this paper, there is also the possibility to integrate optimality search within DisCSP by using the approach of distributed constraint optimization problems (DCOPs) [19].…”
Section: Related Work; Proposed Research Goalsmentioning
confidence: 99%
“…Given all these ideas, it further results that DisCSP can be involved in HMSs. An example about this is shown in [4], where a CSP approach is used for solving scheduling problems. Nevertheless, the use of DisAB for real problems implies several open problems [4].…”
Section: Introduction and Related Workmentioning
confidence: 99%
“…Resource allocation problems, being between the major issues for manufacturing control systems, can be considered for solving through DisAB [4,8]. A control architecture that uses a distributed approach in manufacturing refers to Holonic Manufacturing Systems (HMSs) [9,10].…”
Section: Introduction and Related Workmentioning
confidence: 99%
See 1 more Smart Citation