Lanshun Nie

Cloud manufacturing service composition based on QoS with geo-perspective transportation using an improved Artificial Bee Colony optimisation algorithm

Cloud Manufacturing (CMfg) ambitions to create dedicated manufacturing clouds (i.e. virtual enterprises) for complex manufacturing demands through the association of various service providers’ resources and capabilities. In order to insure a dedicated manufacturing cloud to match the level of customer’s requirements, the cloud service selection and composition appear to be a decisive process. This study takes common aspects of cloud services into consideration such as quality of service (QoS) parameters but extend the scope to the physical location of the manufacturing resources. Unlike the classic service composition, manufacturing brings additional constraints. Consequently, we propose a method based on QoS evaluation along with the geo-perspective correlation from one cloud service to another for transportation impact analysis. We also insure the veracity of the manufacturing time evaluation by resource availability overtime. Since the composition is an exhaustive process in terms of computational time consumption, the proposed method is optimised through an adapted Artificial Bee Colony (ABC) algorithm based on initialisation enhancement. Finally, the efficiency and precision of our method are discussed furthermore in the experiments chapter.

Scheduling Methodology for Production Services in Cloud Manufacturing

Cloud Manufacturing (CMfg) is the delivery of resources control and abilities for manufacturing through the internet. It offers a personalized manufacturing service through several processes (e.g. the order decomposition into tasks, the selection of one or several providers to perform them, the scheduling of the whole manufacturing process). The current paper aims to provide an optimized methodology for task scheduling. In a first time, it identifies the background and general concept of CMfg, focuses further on the scheduling challenges and the environmental data and constraints to propose an optimized methodology for the scheduling process.

COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS

A collaborative planning framework combining the Lagrangian relaxation method and genetic algorithms is developed to coordinate and optimize the production planning of the independent partners linked by material flows in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic multi-level, multi-item capacitated lot sizing problem (MLCLSP) for supply chains. Model MLCLSP was Lagrangian relaxed and decomposed into facility-separable sub-problems. Genetic algorithms was incorporated into Lagrangian relaxation method to update Lagrangian multipliers, which coordinated decentralized decisions of the facilities in supply chains. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decision authorities and private information. This collaborative planning scheme was applied to a large set problem in supply chain production planning. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination in terms of both performance and robustness

INCORPORATING TRANSPORTATION COSTS INTO JIT LOT SPLITTING DECISIONS FOR COORDINATED SUPPLY CHAINS

There is an increased emphasis on making all costs transparent in supply chain management. Transportation costs should be appropriately incorporated into logistics decisions given that transportation costs can be almost 50% of the logistics cost. This study develops a buyer-supplier coordination model to facilitate frequent deliveries in small lot size in manufacturing supply chains. Two transportation cost functions that emulate reality and simultaneously provide a straightforward representation of actual freight rates are identified. Then, they are used to estimate transportation costs and deduce concrete models for truck-load (TL) and less-than-truck-load (LTL). The optimal order quantities of the two deduced models are equal. The solution of the truck-load model has a smaller number of deliveries per order and incurs high inventory cost, while the solution of the less-than-truck-load model has a larger number of deliveries per order and incurs high transportation cost. We propose a heuristic procedure to search the optimal number of deliveries per order in the interval bounded by these two solutions. Experimental results show that the proposed model can guarantee the accuracy and performance of the decision without adding undue complexity and effort to the decision process.

GRAI-ICE Model Driven Interoperability Architecture for Developing Interoperable ESA

This paper presents GRAI-ICE Model Driven Interoperability Architecture (MDI) which is developed based on MDA (Model Driven Architecture) of OMG and some initial works performed in INTEROP NoE. This MDI architecture aims at supporting the development of changeable on-demand and interoperable ESA (Enterprise Software Application). The architecture defined five modelling levels, i.e., Top CIM, Bottom CIM, Object oriented PIM, Pattern oriented PSM, and Component and configuration oriented CODE. This paper presents in detail core concepts and rational of each modeling level. An application example in nuclear equipment industry is outlined.

Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms

A collaborative planning framework combining the Lagrangian Relaxation method and Genetic Algorithms is developed to coordinate and optimize the production planning of the independent partners linked by material flows in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) for supply chains. Model MLCLSP was Lagrangian relaxed and decomposed into facility-separable sub-problems. Genetic Algorithms was incorporated into Lagrangian Relaxation method to update Lagrangian multipliers, which coordinated decentralized decisions of the facilities in supply chains. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decision authorities and private information. This collaborative planning scheme was applied to a large set problem in supply chain production planning. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination in terms of both performance and robustness.

An IoT Service Framework for Smart Home: Case Study on HEM

Nowadays, most of smart home applications are either ad hoc or close/monolithic. So it is critical to study novel software architecture/frameworks which are open, connecting multiple heterogonous devices and multiple networks, supporting multiple concurrent applications, enabling reliable data/command delivery among home gateway and cloud/smart phone, and easy to develop third party service business applications. To achieve the above demand, this paper proposes a service framework for smart home which well combines Lab of Things (HomeOS), MQTT and Azure cloud. To validate this service frameworks rationality and combine high energy consumption of the whole society, based on this service framework, we developed a smart home energy management service system, which includes two sub-systems, i.e. Home energy management application running on home gateway, and energy service system for multi-homes running on Azure cloud and operated by specialized 3rd party energy service provider.

A feature-oriented approach to platform-specific modelling of coarse-grained components

Coarse-grained-component-based software development improves efficiency when developing large-scale software for enterprises. However, there are no rigorous models to describe the component because of its structural complexity. Aiming to obtain a correct and formal model, this paper presents a feature-based platform-specific modelling approach for coarse-grained components. The component is described by the Feature Relationship Tree (FRT) from the perspectives of function and implementation. By establishing mapping between the feature model and the PSM, the meta-PSM of the component is defined on the basis of typical patterns. A practical case is described to validate the method in this paper.

Research framework for decentralized multi-project scheduling problem

Multi-project environment is quite common in modern day, and the decentralized multi-project scheduling problem has been a hot research direction since last decade. Compared with centralized multi-project problem, decentralized multi-project problem has new characteristics in these fields such as decision maker, decision mode, and decision objective. Existing research works most focus on one particular issue of the problem, and has not formed a generally accepted definition and classification for the problem. In this paper, we propose the definition of decentralized multi-project scheduling problem and analyze the characteristics, and then propose the research framework based on the analysis. We map and locate some existing works in this research framework. At last give a short conclusion.

A Novel Genetic Simulated Annealing Algorithm for the Resource-Constrained Project Scheduling Problem

A novel hybrid meta-heuristic algorithm, entitled as RCPSPGSA, is proposed for solving the resource-constrained project scheduling problem (RCPSP) in this paper. The algorithm incorporates the simulated annealing algorithm (SA) into genetic algorithm in order to improve local searching performance and boost up evolution capability. In each evolution iteration GA generates a new temporary population, and after that SA is used for improving every individual in it and at the mean time the next gap population is generated. For the sake of keeping the same convergence direction and speed of GA and SA, the cooling procedure occurs at the end of each evolution iteration. Simulation experiments are performed on the standard project instance sets of PSPLIB, and orthogonal experiment method is introduced to solve the parameter selection problem. Parameter combinations selected by this method are proved to be outperformed. Experimental results show that RCPSPGSA improves solution quality for J30, J60, J90 sets and not bad for J120.