Enhanced cell controller for aerospace manufacturing

Aerospace manufacturing industry is unique in that production typically focuses on high variety and quality but extremely low volume. Manufacturing processes are also sometimes unique and not repeatable and, hence, costly. Production is getting more expensive with the introduction of industrial robots and their cells. This paper describes the development of the Flexa Cell Coordinator (FCC), a system that is providing a solution to manage resources at assembly cell level. It can control, organise and coordinate between the resources and is capable of controlling remote cells and resources because of its distributed nature. It also gives insight of a system to the higher management via its rich reporting facility and connectivity with company systems e.g., Enterprise Resource Planner (ERP). It is able to control various kinds of cells and resources (network based) which are not limited to robots and machines. It is extendable and capable of adding multiple numbers of cells inside the system. It also provides the facility of scheduling the task to avoid the deadlocking in the process. In FCC resources (e.g., tracker) can also be shared between cells

Performance analysis of a palletizing system

When designing the layout of the material handling system for a warehouse there is a need for the analysis of overall system performance. Since warehouses are typically very large and complex systems it is infeasible to build a simulation model for the entire system. Our approach is to divide the system into subsystems that are small enough to be captured in simulation models. These models can then later be assembled to acquire a simulation model of the entire system. In this case study we assess the feasibility of this approach by creating a simulation model of a part of a warehouse and verify whether it can be used to embed it in a larger simulation model. The subsystem we use for our case study is a container unloading and automatic palletizing system. This system is chosen because it has already been studied extensively using another simulation tool. We also do a performance analysis of this system in order to come to an optimal layout for this subsystem as well as to reproduce the results of the earlier study for validation. For our performance analysis we created a chi model of the unloading and palletizing area. The process algebra chi has been extensively used for modeling and simulation of real-time manufacturing systems. Our case study is also used as a means to assess the suitability of chi for modeling and simulation in a logistics environment. Our experiments resulted in roughly the same outcomes as the earlier study. It turns out that for the required throughput the layout chosen in that study is optimal. We also concluded that chi is perfectly suitable for modeling logistic systems. Considering the extensive time it takes to run simulations of a rather small part of a warehouse using chi, we conclude that it is infeasible to perform simulations of entire warehousing systems by integrating the simulation models of all subsystems into one simulation model. To overcome this problem, aggregate modeling can be used

Federated Robust Embedded Systems: Concepts and Challenges

The development within the area of embedded systems (ESs) is moving rapidly, not least due to falling costs of computation and communication equipment. It is believed that increased communication opportunities will lead to the future ESs no longer being parts of isolated products, but rather parts of larger communities or federations of ESs, within which information is exchanged for the benefit of all participants. This vision is asserted by a number of interrelated research topics, such as the internet of things, cyber-physical systems, systems of systems, and multi-agent systems. In this work, the focus is primarily on ESs, with their specific real-time and safety requirements. While the vision of interconnected ESs is quite promising, it also brings great challenges to the development of future systems in an efficient, safe, and reliable way. In this work, a pre-study has been carried out in order to gain a better understanding about common concepts and challenges that naturally arise in federations of ESs. The work was organized around a series of workshops, with contributions from both academic participants and industrial partners with a strong experience in ES development. During the workshops, a portfolio of possible ES federation scenarios was collected, and a number of application examples were discussed more thoroughly on different abstraction levels, starting from screening the nature of interactions on the federation level and proceeding down to the implementation details within each ES. These discussions led to a better understanding of what can be expected in the future federated ESs. In this report, the discussed applications are summarized, together with their characteristics, challenges, and necessary solution elements, providing a ground for the future research within the area of communicating ESs

Resource-constrained project scheduling.

Abstract: Resource-constrained project scheduling involves the scheduling of project activities subject to precedence and resource constraints in order to meet the objective(s) in the best possible way. The area covers a wide variety of problem types. The objective of this paper is to provide a survey of what we believe are important recent in the area . Our main focus will be on the recent progress made in and the encouraging computational experience gained with the use of optimal solution procedures for the basic resource-constrained project scheduling problem (RCPSP) and important extensions. The RCPSP involves the scheduling of a project its duration subject to zero-lag finish-start precedence constraints of the PERT/CPM type and constant availability constraints on the required set of renewable resources. We discuss recent striking advances in dealing with this problem using a new depth-first branch-and-bound procedure, elaborating on the effective and efficient branching scheme, bounding calculations and dominance rules, and discuss the potential of using truncated branch-and-bound. We derive a set of conclusions from the research on optimal solution procedures for the basis RCPSP and subsequently illustrate how effective and efficient branching rules and several of the strong dominance and bounding arguments can be extended to a rich and realistic variety of related problems. The preemptive resource-constrained project scheduling problem (PRCPSP) relaxes the nonpreemption condition of the RCPSP, thus allowing activities to be interrupted at integer points in time and resumed later without additional penalty cost. The generalized resource-constrained project scheduling (GRCPSP) extends the RCPSP to the case of precedence diagramming type of precedence constraints (minimal finish-start, start-start, start-finish, finish-finish precedence relations), activity ready times, deadlines and variable resource availability's. The resource-constrained project scheduling problem with generalized precedence relations (RCPSP-GPR) allows for start-start, finish-start and finish-finish constraints with minimal and maximal time lags. The MAX-NPV problem aims at scheduling project activities in order to maximize the net present value of the project in the absence of resource constraints. The resource-constrained project scheduling problem with discounted cash flows (RCPSP-DC) aims at the same non-regular objective in the presence of resource constraints. The resource availability cost problem (RACP) aims at determining the cheapest resource availability amounts for which a feasible solution exists that does not violate the project deadline. In the discrete time/cost trade-off problem (DTCTP) the duration of an activity is a discrete, non-increasing function of the amount of a single nonrenewable resource committed to it. In the discrete time/resource trade-off problem (DTRTP) the duration of an activity is a discrete, non-increasing function of the amount of a single renewable resource. Each activity must then be scheduled in one of its possible execution modes. In addition to time/resource trade-offs, the multi-mode project scheduling problem (MRCPSP) allows for resource/resource trade-offs and constraints on renewable, nonrenewable and doubly-constrained resources. We report on recent computational results and end with overall conclusions and suggestions for future research.Scheduling; Optimal;

Computer systems analysis methodology - Studies in measuring, evaluating, and simulating computer systems

Computer systems analysis and simulation studies on design, development, and management of complex computer system