ISSN 2353-6977 (Online)
Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that context, CP can be considered as an appropriate framework for development of decision making software supporting scheduling of multi-robot in a multi-product flow shop. The paper deals with multi-resource problem in which more than one shared renewable resource type may be required by manufacturing operation and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a knowledge based and
CLP-driven approach to multi-robot task allocation framework providing a prompt service to a set of routine queries stated both in straight and reverse way. Provided example concentrates on the first case taking into account both an accurate and an uncertain specification of robots operation time
| < Prev | Next > |
|---|
