Simulation modelling software approaches to manufacturing problems

Increased competition in many industries has resulted in a greater emphasis on developing and using advanced manufacturing systems to improve productivity and reduce costs. The complexity and dynamic behaviour of such systems, make simulation modelling one of the most popular methods to facilitate the design and assess operating strategies of these systems. The growing need for the use of simulation is reflected by a growth in the number of simulation languages and data-driven simulators in the software market. This thesis investigates which characteristics typical manufacturing simulators possess, and how the user requirements can be better fulfilled. For the purpose of software evaluation, a case study has been carried out on a real manufacturing system. Several simulation models of an automated system for electrostatic powder coating have been developed using different simulators. In addition to the evaluation of these simulators, a comprehensive evaluation framework has been developed to facilitate selection of simulation software for modelling manufacturing systems. Different hierarchies of evaluation criteria have been established for different software purposes. In particular, the criteria that have to be satisfied for users in education differ from those for users in industry. A survey has also been conducted involving a number of users of software for manufacturing simulation. The purpose of the survey was to investigate users' opinions about simulation software, and the features that they desire to be incorporated in simulation software. A methodology for simulation software selection is also derived. It consists of guidelines related to the actions to be taken and factors to be considered during the evaluation and selection of simulation software. On the basis of all the findings, proposals on how manufacturing simulators can be improved are made, both for use in education and in industry. These software improvements should result in a reduction in the amount of time and effort needed for simulation model development, and therefore make simulation more beneficial

LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks

Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft

Communication models for monitoring and mobility verification in mission critical wireless networks

Recent technological advances have seen wireless sensor networks emerge as an interesting research topic because of its ability to realize mission critical applications like in military or wildfire detection. The first part of the thesis focuses on the development of a novel communication scheme referred here as a distributed wireless critical information-aware maintenance network (DWCIMN), which is presented for preventive maintenance of network-centric dynamic systems. The proposed communication scheme addresses quality of service (QoS) issues by using a combination of a head-of-the-line queuing scheme, efficient bandwidth allocation, weight-based backoff mechanism, and a distributed power control scheme. A thorough analysis of a head-of-the-line priority queuing scheme is given for a single-server, finite queue with a batch arrival option and user priorities. The scheme is implemented in the Network Simulator (NS-2), and the results demonstrate reduced queuing delays and efficient bandwidth allocation for time-critical data over non time critical data. In the second part, we introduce a unique mobility verification problem in wireless sensor networks wherein the objective is to verify the claimed mobility path of a node in a co-operating mission critical operation between two allies. We address this problem by developing an efficient power-control based mobility verification model. The simulation framework is implemented in Matlab and the results indicate successful detection of altered claimed paths within a certain error bound --Abstract, page iii

Architecting Efficient Data Centers.

Data center power consumption has become a key constraint in continuing to scale Internet services. As our society’s reliance on “the Cloud” continues to grow, companies require an ever-increasing amount of computational capacity to support their customers. Massive warehouse-scale data centers have emerged, requiring 30MW or more of total power capacity. Over the lifetime of a typical high-scale data center, power-related costs make up 50% of the total cost of ownership (TCO). Furthermore, the aggregate effect of data center power consumption across the country cannot be ignored. In total, data center energy usage has reached approximately 2% of aggregate consumption in the United States and continues to grow. This thesis addresses the need to increase computational efficiency to address this grow- ing problem. It proposes a new classes of power management techniques: coordinated full-system idle low-power modes to increase the energy proportionality of modern servers. First, we introduce the PowerNap server architecture, a coordinated full-system idle low- power mode which transitions in and out of an ultra-low power nap state to save power during brief idle periods. While effective for uniprocessor systems, PowerNap relies on full-system idleness and we show that such idleness disappears as the number of cores per processor continues to increase. We expose this problem in a case study of Google Web search in which we demonstrate that coordinated full-system active power modes are necessary to reach energy proportionality and that PowerNap is ineffective because of a lack of idleness. To recover full-system idleness, we introduce DreamWeaver, architectural support for deep sleep. DreamWeaver allows a server to exchange latency for full-system idleness, allowing PowerNap-enabled servers to be effective and provides a better latency- power savings tradeoff than existing approaches. Finally, this thesis investigates workloads which achieve efficiency through methodical cluster provisioning techniques. Using the popular memcached workload, this thesis provides examples of provisioning clusters for cost-efficiency given latency, throughput, and data set size targets.Ph.D.Computer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/91499/1/meisner_1.pd

Developing service supply chains by using agent based simulation

The Master thesis present a novel approach to model a service supply chain with agent based simulation. Also, the case study of thesis is related to healthcare services and research problem includes facility location of healthcare centers in Vaasa region by considering the demand, resource units and service quality. Geographical information system is utilized for locating population, agent based simulation for patients and their illness status probability, and discrete event simulation for healthcare services modelling. Health centers are located on predefined sites based on managers’ preference, then each patient based on the distance to health centers, move to the nearest point for receiving the healthcare services. For evaluating cost and services condition, various key performance indicators have defined in the modelling such as Number of patient in queue, patients waiting time, resource utilization, and number of patients ratio yielded by different of inflow and outflow. Healthcare managers would be able to experiment different scenarios based on changing number of resource units or location of healthcare centers, and subsequently evaluate the results without necessity of implementation in real life.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Generalized gap acceptance models for unsignalized intersections

This paper contributes to the modeling and analysis of unsignalized intersections. In classical gap acceptance models vehicles on the minor road accept any gap greater than the CRITICAL gap, and reject gaps below this threshold, where the gap is the time between two subsequent vehicles on the major road. The main contribution of this paper is to develop a series of generalizations of existing models, thus increasing the model's practical applicability significantly. First, we incorporate {driver impatience behavior} while allowing for a realistic merging behavior; we do so by distinguishing between the critical gap and the merging time, thus allowing MULTIPLE vehicles to use a sufficiently large gap. Incorporating this feature is particularly challenging in models with driver impatience. Secondly, we allow for multiple classes of gap acceptance behavior, enabling us to distinguish between different driver types and/or different vehicle types. Thirdly, we use the novel M$^X$/SM2/1 queueing model, which has batch arrivals, dependent service times, and a different service-time distribution for vehicles arriving in an empty queue on the minor road (where `service time' refers to the time required to find a sufficiently large gap). This setup facilitates the analysis of the service-time distribution of an arbitrary vehicle on the minor road and of the queue length on the minor road. In particular, we can compute the MEAN service time, thus enabling the evaluation of the capacity for the minor road vehicles