The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Dynamic Cell Formation Problem (DCFP) seeks to cope with variation in part mix and demands using machine relocation, replication, and removing; whilst from practical point of view it is too hard to move machines between cells or invest on machine replication. To cope with this deficiency, this paper addresses Reconfigurable Dynamic Cell Formation Problem (RDCFP) in which machine modification is conducted instead of their relocation or replication in order to enhance machine capabilities to process...
An algebraic and combinatorial approach to the study of
the Quadratic Assignment Problem produced theoretical results that can
be applied to (meta) heuristics to give them information about the
problem structure, allowing the construction of algorithms. In this
paper those results were applied to inform a Simulated Annealing-type
heuristic (which we called RedInv-SA). Some results from tests with
known literature instances are presented.
Currently displaying 1 –
6 of
6