Ancient monolithic distributed systems were attached to well-known development practices and offline analysis. Current scenarios are more dynamic, and open, plenty of applications and services which appear and disappear dynamically at runtime. Likewise, these scenarios require taking into account actions that were traditionally addressed offline, this time in an online scenario. This paper cont...

Module-based FPGA reconfiguration offers virtualization and multitasking capabilities, but to support this, many problems need to be solved. Current methodologies are very specific and are not capable of scaling or of being reused for other applications. This thesis proposes a methodology whereby the use of dynamic reconfiguration is supported for every core independent of the communication int...

In this study, we have classified different types of problems which are related to facility planning and layout design for different types of manufacturing processes. The main problems which are related to location of facilities which also affects the system performance such as distribution of man, material and machine in a plant or a factory and their optimization technique while using of math...

In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...

We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem (MINLP). For the class of opt...

A lot of Metaheuristics for solving dynamic combinatorial facility layout problems have been developed, but still require much computation time when the number of facilities or planning horizon is large. Dynamic facility layout should meet a dynamic change in both product mix and demand quantity of each product over a planning horizon by adjusting facility layout effectively under a given syste...

The floor layout problem (FLP) tasks a designer with positioning a collection of rectangular boxes on a fixed floor in such a way that minimizes total communication costs between the components. While several mixed integer programming (MIP) formulations for this problem have been developed, it remains extremely challenging from a computational perspective. This work takes a systematic approach ...

Forthcoming networked systems require mechanisms for on-the-fly reconfiguration in their protocol stacks to be able to operate in different situations and networks. Since every protocol in a protocol stack has at least one peer protocol in another system, dynamic reconfiguration of a protocol raises the need for reconfiguration in the peer stack. For an assured dynamic (run-time) reconfiguratio...

the location and type of the territory centers from potential branches and allocation of the customer base to these territory centers with respect to particular planning criteria. We utilize the twophase location-allocation optimization approach that was proposed in [1] in order to construct a multi-criteria territory design for a single MF؛. This model considers both the mean and variance of a...

The double row layout problem (DRLP) seeks to determine optimal machine locations on either side of an aisle, where the objective has been defined as the minimization of material flow cost among machines while meeting machine clearance constraints. In this paper, we extend existing DRLP formulations in two respects. First, we consider the minimization of layout area besides the usual material f...