DI-MMAP: A High Performance Memory-Map Runtime for Data-Intensive Applications

Abstract not provide

SME and Planning in Supply Chains:a Socio-technical View

The co-existence of large and small companies in nowadays supply chains may led to misunderstandings which are prejudicial to the supply chain performance. Based on several studies in aeronautical supply chains, we list some of typical problems linked to the relationship between large and small companies, and show how the solutions promoted by large companies may in some cases be inadequate. We suggest to use different frameworks suggested in social sciences for better understanding the origins of these problems and provide some guidelines for defining a framework of cooperation between large and small companies, oriented on a better mutual understanding

Supply chain management of blood products: a literature review.

This paper presents a review of the literature on inventory and supply chain management of blood products. First, we identify different perspectives on approaches to classifying the existing material. Each perspective is presented as a table in which the classification is displayed. The classification choices are exemplified through the citation of key references or by expounding the features of the perspective. The main contribution of this review is to facilitate the tracing of published work in relevant fields of interest, as well as identifying trends and indicating which areas should be subject to future research.OR in health services; Supply chain management; Inventory; Blood products; Literature review;

Applicability of advanced planning and scheduling on surgical blocks

An assessment of the suitability of Advanced Planning and Scheduling software on operating rooms and materials centre is carried out. From data gathering and process mapping a scheduling system is implemented and compared to a private hospital’s approach and information system. A method for compromising schedule assertiveness and productivity is proposed and tested on a simulation setting. Final remarks contend that Advanced Planning and Scheduling is a viable tool for surgical block scheduling on the studied hospital and may improve synchronicity with materials centre, sophisticate rescheduling and enable scenario comparison through scheduling simulation

A novel queue management policy for delay-tolerant networks

Delay-tolerant networks (DTNs) have attracted increasing attention from governments, academia and industries in recent years. They are designed to provide a communication channel that exploits the inherent mobility of trams, buses and cars. However, the resulting highly dynamic network suffers from frequent disconnections, thereby making node-to-node communications extremely challenging. Researchers have thus proposed many routing/forwarding strategies in order to achieve high delivery ratios and/or low latencies and/or low overheads. Their main idea is to have nodes store and carry information bundles until a forwarding opportunity arises. This, however, creates the following problems. Nodes may have short contacts and/or insufficient buffer space. Consequently, nodes need to determine (i) the delivery order of bundles at each forwarding opportunity and (ii) the bundles that should be dropped when their buffer is full. To this end, we propose an efficient scheduling and drop policy for use under quota-based protocols. In particular, we make use of the encounter rate of nodes and context information such as time to live, number of available replicas and maximum number of forwarded bundle replicas to derive a bundle\u27s priority. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that the proposed policy achieves up to 80 % improvement when nodes have an infinite buffer and up to 35 % when nodes have a finite buffer over six popular queuing policies: Drop Oldest (DO), Last Input First Output (LIFO), First Input First Output (FIFO), Most FOrwarded first (MOFO), LEast PRobable first (LEPR) and drop bundles with the greatest hop-count (HOP-COUNT)