Thiswork presents a constraint satisfaction problem
(CSP) model for the planning and scheduling of disassembly
and assembly tasks when repairing or substituting
faulty parts. The problem involves not only the ordering of
assembly and disassembly tasks, but also the selection of
them from a set of alternatives. The goal of the plan is the minimization
of the total repairing time, and the model considers,
apart from the durations and resources used for the assembly
and disassembly tasks, the necessary delays due to the change
of configuration in the machines, and to the transportation
of intermediate subassemblies between different machines.
The problem considers that sub-assemblies that do not contain
the faulty part are nor further disassembled, but allows
non-reversible and parallel repair plans. The set of all feasible
repair plans are represented by an extended And/Or graph.
This extended representation embodies all of the constraints
of the problem, such as temporal and resource constraints and
those related to the selection of tasks for obtaining a correct
plan.Ministerio de Educación y Ciencia DIP2006-15476-C02-0
