The complexity of partition tasks

Abstract

In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system to solve them. We explore, via simulations, some potential applications of these concepts and present some results as examples that highlight their usefulness in policy design scenarios, where the optimal number of elements in a partition or the optimal size of the elements in a partition must be determined.

On optimal modularity for system construction

“…There is acknowledgment in the literature that modularity of a system or product has different utilities in different life‐cycle stages . For example, modularity facilitates parallel design/optimization of modules and optimal partitioning of design tasks , independent manufacturing and supply of manufacturing parts , disposal , and disintegration and reuse of software modules . Another example is extendibility which is the accommodation of functional variety through plug‐in extensions with new applications .…”