<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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 job shop. The paper deals with multi-resource problem in which more than one shared renewable and non-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 providing a prompt service to a set of routine queries stated both in straight and reverse way. Provided examples illustrate both cases while taking into account an accurate as well as an uncertain specification of robots and workers operation time.</p></abstract>

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 job shop. The paper deals with multi-resource problem in which more than one shared renewable and non-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 providing a prompt service to a set of routine queries stated both in straight and reverse way. Provided examples illustrate both cases while taking into account an accurate as well as an uncertain specification of robots and workers operation time.

Abductive Reasoning Driven Approach to Project - Like Production Flow Prototyping

Department of Computer Science and Management, Technical University of Koszalin, 75-453 Koszalin, Poland

Faculty of Management, Warsaw University of Technology, 02-524 Warszawa, Poland

Foundations of Management

Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in...

Abductive Reasoning Driven Approach to Project - Like Production Flow Prototyping

Data publikacji: 19 mar 2012

Zakres stron: 43 - 62

DOI: https://doi.org/10.2478/v10238-012-0004-0

Słowa kluczowe
knowledge engineering, modeling, constraints logic programming, scheduling

This content is open access.

Abductive Reasoning Driven Approach to Project - Like Production Flow Prototyping

Data publikacji: 19 mar 2012

Zakres stron: 43 - 62

DOI: https://doi.org/10.2478/v10238-012-0004-0

Słowa kluczoweknowledge engineering, modeling, constraints logic programming, scheduling

This content is open access.

Słowa kluczowe
knowledge engineering, modeling, constraints logic programming, scheduling