Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms

The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of theoptimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies

Evaluation of Pull Production Control Strategies Under Uncertainty: An Integrated Fuzzy Ahp-Topsis Approach

Purpose: Just-In-Time (JIT) production has continuously been considered by industrial practitioners and researchers as a leading strategy for the yet popular Lean production. Pull Production Control Policies (PPCPs) are the major enablers of JIT that locally control the level of inventory by authorizing the production in each station. Aiming to improve the PPCPs, three authorization mechanisms: Kanban, constant-work-in-process (ConWIP), and a hybrid system, are evaluated by considering uncertainty. Design/methodology/approach: Multi-Criteria Decision Making (MCDM) methods are successful in evaluating alternatives with respect to several objectives. The proposed approach of this study applies the fuzzy set theory together with an integrated Analytical Hierarchy Process (AHP) and a Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) method. Findings: The study finds that hybrid Kanban-ConWIP pull production control policies have a better performance in controlling the studied multi-layer multi-stage manufacturing and assembly system. Practical implications: To examine the approach a real case from automobile electro-mechanical part production industry is studied. The production system consists of multiple levels of manufacturing, feeding a multi-stage assembly line with stochastic processing times to satisfy the changing demand. Originality/value: This study proposes the integrated Kanban-ConWIP hybrid pull control policies and implements several alternatives on a multi-stage and multi-layer manufacturing and assembly production system. An integrated Fuzzy AHP TOPSIS method is developed to evaluate the alternatives with respect to several JIT criteriaPeer Reviewe

An overview of decision table literature 1982-1995.

This report gives an overview of the literature on decision tables over the past 15 years. As much as possible, for each reference, an author supplied abstract, a number of keywords and a classification are provided. In some cases own comments are added. The purpose of these comments is to show where, how and why decision tables are used. The literature is classified according to application area, theoretical versus practical character, year of publication, country or origin (not necessarily country of publication) and the language of the document. After a description of the scope of the interview, classification results and the classification by topic are presented. The main body of the paper is the ordered list of publications with abstract, classification and comments.

A review on anaerobic membrane bioreactors (AnMBRs) focused on modelling and control aspects

[EN] The use of anaerobic membrane bioreactor technology (AnMBR) is rapidly expanding. However, depending on the application, AnMBR design and operation is not fully mature, and needs further research to optimize process efficiency and enhance applicability. This paper reviews state-of-the-art of AnMBR focusing on modelling and control aspects. Quantitative environmental and economic evaluation has demonstrated substantial advantages in application of AnMBR to domestic wastewater treatment, but detailed modelling is less mature. While anaerobic process modelling is generally mature, more work is needed on integrated models which include coupling between membrane performance (including fouling) and the biological process. This should include microbial factors, which are important to generation of specific foulants such as soluble and particulate inert organics. Mature and well-established control tools, including better feedback control strategies are also required for both the process, and for fouling control.This work has been carried out under the umbrella of the Task Group on Membrane Bioreactor Modelling and Control of the International Water Association (IWA) (http://www.iwa-network.org/groups/membrane-bioreactor-modelling-and-control/). The authors also want to acknowledge the support from Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science & ICT (2017R1A2B4007804).Robles Martínez, Á.; Ruano García, MV.; Charfi, A.; Lesage, G.; Heran, M.; Harmand, J.; Seco Torrecillas, A.... (2018). A review on anaerobic membrane bioreactors (AnMBRs) focused on modelling and control aspects. Bioresource Technology. 270:612-626. https://doi.org/10.1016/j.biortech.2018.09.049S61262627

Learning algorithms for the control of routing in integrated service communication networks

There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the traffic demands. The adaptive control mechanisms must be 'lightweight', in terms of their overheads, and scale to potentially large networks with many traffic flows. Adaptive routing is one form of adaptive resource allocation, and this thesis considers the application of Stochastic Learning Automata (SLA) for distributed, lightweight adaptive routing in future integrated service communication networks. The thesis begins with a broad critical review of the use of Artificial Intelligence (AI) techniques applied to the control of communication networks. Detailed simulation models of integrated service networks are then constructed, and learning automata based routing is compared with traditional techniques on large scale networks. Learning automata are examined for the 'Quality-of-Service' (QoS) routing problem in realistic network topologies, where flows may be routed in the network subject to multiple QoS metrics, such as bandwidth and delay. It is found that learning automata based routing gives considerable blocking probability improvements over shortest path routing, despite only using local connectivity information and a simple probabilistic updating strategy. Furthermore, automata are considered for routing in more complex environments spanning issues such as multi-rate traffic, trunk reservation, routing over multiple domains, routing in high bandwidth-delay product networks and the use of learning automata as a background learning process. Automata are also examined for routing of both 'real-time' and 'non-real-time' traffics in an integrated traffic environment, where the non-real-time traffic has access to the bandwidth 'left over' by the real-time traffic. It is found that adopting learning automata for the routing of the real-time traffic may improve the performance to both real and non-real-time traffics under certain conditions. In addition, it is found that one set of learning automata may route both traffic types satisfactorily. Automata are considered for the routing of multicast connections in receiver-oriented, dynamic environments, where receivers may join and leave the multicast sessions dynamically. Automata are shown to be able to minimise the average delay or the total cost of the resulting trees using the appropriate feedback from the environment. Automata provide a distributed solution to the dynamic multicast problem, requiring purely local connectivity information and a simple updating strategy. Finally, automata are considered for the routing of multicast connections that require QoS guarantees, again in receiver-oriented dynamic environments. It is found that the distributed application of learning automata leads to considerably lower blocking probabilities than a shortest path tree approach, due to a combination of load balancing and minimum cost behaviour

Energy-Efficient Flexible Flow Shop Scheduling With Due Date and Total Flow Time

One of the most significant optimization issues facing a manufacturing company is the flexible flow shop scheduling problem (FFSS). However, FFSS with uncertainty and energy-related elements has received little investigation. Additionally, in order to reduce overall waiting times and earliness/tardiness issues, the topic of flexible flow shop scheduling with shared due dates is researched. Using transmission line loadings and bus voltage magnitude variations, an unique severity function is formulated in this research. Optimize total energy consumption, total agreement index, and make span all at once. Many different meta-heuristics have been presented in the past to find near-optimal answers in an acceptable amount of computation time. To explore the potential for energy saving in shop floor management, a multi-level optimization technique for flexible flow shop scheduling and integrates power models for individual machines with cutting parameters optimisation into energy-efficient scheduling issues is proposed. However, it can be difficult and time-consuming to fine-tune algorithm-specific parameters for solving FFSP

Self-adaptivity of applications on network on chip multiprocessors: the case of fault-tolerant Kahn process networks

Technology scaling accompanied with higher operating frequencies and the ability to integrate more functionality in the same chip has been the driving force behind delivering higher performance computing systems at lower costs. Embedded computing systems, which have been riding the same wave of success, have evolved into complex architectures encompassing a high number of cores interconnected by an on-chip network (usually identified as Multiprocessor System-on-Chip). However these trends are hindered by issues that arise as technology scaling continues towards deep submicron scales. Firstly, growing complexity of these systems and the variability introduced by process technologies make it ever harder to perform a thorough optimization of the system at design time. Secondly, designers are faced with a reliability wall that emerges as age-related degradation reduces the lifetime of transistors, and as the probability of defects escaping post-manufacturing testing is increased. In this thesis, we take on these challenges within the context of streaming applications running in network-on-chip based parallel (not necessarily homogeneous) systems-on-chip that adopt the no-remote memory access model. In particular, this thesis tackles two main problems: (1) fault-aware online task remapping, (2) application-level self-adaptation for quality management. For the former, by viewing fault tolerance as a self-adaptation aspect, we adopt a cross-layer approach that aims at graceful performance degradation by addressing permanent faults in processing elements mostly at system-level, in particular by exploiting redundancy available in multi-core platforms. We propose an optimal solution based on an integer linear programming formulation (suitable for design time adoption) as well as heuristic-based solutions to be used at run-time. We assess the impact of our approach on the lifetime reliability. We propose two recovery schemes based on a checkpoint-and-rollback and a rollforward technique. For the latter, we propose two variants of a monitor-controller- adapter loop that adapts application-level parameters to meet performance goals. We demonstrate not only that fault tolerance and self-adaptivity can be achieved in embedded platforms, but also that it can be done without incurring large overheads. In addressing these problems, we present techniques which have been realized (depending on their characteristics) in the form of a design tool, a run-time library or a hardware core to be added to the basic architecture