Training and assignment of multi-skilled workers for implementing seru production systems

Confronted with high variety and low volume market demands, many companies, especially the Japanese electronics manufacturing companies, have reconfigured their conveyor assembly lines and adopted seru production systems. Seru production system is a new type of work-cell-based manufacturing system. A lot of successful practices and experience show that seru production system can gain considerable flexibility of job shop and high efficiency of conveyor assembly line. In implementing seru production, the multi-skilled worker is the most important precondition, and some issues about multi-skilled workers are central and foremost. In this paper, we investigate the training and assignment problem of workers when a conveyor assembly line is entirely reconfigured into several serus. We formulate a mathematical model with double objectives which aim to minimize the total training cost and to balance the total processing times among multi-skilled workers in each seru. To obtain the satisfied task-to-worker training plan and worker-to-seru assignment plan, a three-stage heuristic algorithm with nine steps is developed to solve this mathematical model. Then, several computational cases are taken and computed by MATLAB programming. The computation and analysis results validate the performances of the proposed mathematical model and heuristic algorithm. © 2013 Springer-Verlag London.

Development of low entropy coding in a recurrent network.

In this paper we present an unsupervised neural network which exhibits competition between units via inhibitory feedback. The operation is such as to minimize reconstruction error, both for individual patterns, and over the entire training set. A key difference from networks which perform principal components analysis, or one of its variants, is the ability to converge to non-orthogonal weight values. We discuss the network's operation in relation to the twin goals of maximizing information transfer and minimizing code entropy, and show how the assignment of prior probabilities to network outputs can help to reduce entropy. We present results from two binary coding problems, and from experiments with image coding.

Linking energy policy, electricity generation and transmission using strong sustainability and co-optimization

The design of a sustainable electricity generation and transmission system is based on the established science of anthropogenic climate change and the realization that depending on imported fossil-fuels is becoming a measure of energy insecurity of supply. A model is proposed which integrates generation fuel mix composition, assignment of plants and optimized power flow, using Portugal as a case study. The result of this co-optimized approach is an overall set of generator types/fuels which increases the diversity of Portuguese electricity supply, lowers its dependency on imported fuels by 14.62% and moves the country towards meeting its regional and international obligations of 31% energy from renewables by 2020 and a 27% reduction in greenhouse gas emissions by 2012, respectively. The quantity and composition of power generation at each bus is specified, with particular focus on quantifying the amount of distributed generation. Based on other works, the resultant, overall distributed capacity penetration of 19.02% of total installed generation is expected to yield positive network benefits. Thus, the model demonstrates that national energy policy and technical deployment can be linked through sustainability and, moreover, that the respective goals may be mutually achieved via holistic, integrated design. ©2009 IEEE.

High-level scene structure using visibility and occlusion

We demonstrate a new method for extracting high-level scene information from the type of data available from simultaneous localisation and mapping systems. We model the scene with a collection of primitives (such as bounded planes), and make explicit use of both visible and occluded points in order to refine the model. Since our formulation allows for different kinds of primitives and an arbitrary number of each, we use Bayesian model evidence to compare very different models on an even footing. Additionally, by making use of Bayesian techniques we can also avoid explicitly finding the optimal assignment of map landmarks to primitives. The results show that explicit reasoning about occlusion improves model accuracy and yields models which are suitable for aiding data association. © 2011. The copyright of this document resides with its authors.