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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
