A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A Declarative Framework for Constrained Search Problems in Manufacturing
Automation and Robotics
Constrained search problems Constrained search problems (e.g., scheduling, planning, resource allocation, placement, routing) appear frequently at different levels of decision in manufacturing. They are usually characterized by technical, environmental or manpower constraints, which make them unstructured, and in most of the cases are difficult to solve (NP-complete). Traditional mathematical programming approaches (linear programming, integer and mixed integer programming) are deficient in thedoi:10.5772/6107 fatcat:h2skdpbe2vbpnpsjrhnas6ghgq