Cloud manufacturing service composition and optimal selection with sustainability considerations: a multi-objective integer bi-level multi-follower programming approach

The process of service composition and optimal selection (SCOS) is an important issue in cloud manufacturing (CMfg). However, the current studies on CMfg and SCOS have generally focused on optimising the allocation of resources against quality of service (QoS), in terms of e.g. cost, quality, and time. They have seldom taken the perspective of sustainability into discussion, although sustainability is indispensable in the CMfg environment. Addressing this gap, we aim to (1) propose a comprehensive method to assess the sustainability of cloud manufacturing (SoM) in terms of the economic, environmental, and social aspects; (2) establish a multi-objective integer bi-level multi-follower programming (MOIBMFP) model to simultaneously maximise SoM and QoS from the perspectives of both platform operator and multiple service demanders; and (3) design a hybrid particle swarm optimisation algorithm to solve the proposed MOIBMFP model. The experimental results show that the proposed algorithm is more feasible and effective than the typical multi-objective particle swarm optimisation algorithm when solving the proposed model. In other words, the proposed model and algorithm suggest better alternatives to meet the needs of the platform operator and service demanders in the CMfg environment.     

A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility

The traditional flexible job shop scheduling problem (FJSP) considers machine flexibility but not worker flexibility. Given the influence and potential of human factors in improving production efficiency and decreasing the cost in practical production systems, we propose a mathematical model of an extended FJSP with worker flexibility (FJSPW). A hybrid artificial bee colony algorithm (HABCA) is presented to solve the proposed FJSPW. For the HABCA, effective encoding, decoding, crossover and mutation operators are designed, and a new effective local search method is developed to improve the speed and exploitation ability of the algorithm. The Taguchi method of Design of Experiments is used to obtain the best combination of key parameters of the HABCA. Extensive computational experiments carried out to compare the HABCA with some well-performing algorithms from the literature confirm that the proposed HABCA is more effective than these algorithms, especially on large-scale FJSPW instances.     

A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations

Overlapping in operations is an effective technology for productivity improvement in modern manufacturing systems. Thus far, however, there are still rare works on flexible job shop scheduling problems (FJSPs) concerning this strategy. In this paper, we present a hybrid artificial bee colony (hyABC) algorithm to minimise the total flowtime for a FJSP with overlapping in operations. In the proposed hyABC, a dynamic scheme is introduced to fine-tune the search scope adaptively. In view of poor exploitation ability of artificial bee colony algorithm, a modified migrating birds optimisation algorithm (MMBO) is developed and integrated into the search process for better balancing global exploration and local exploitation. In MMBO, a forward share strategy with one-job based crossover is designed to make good use of valuable information from behind solutions. Besides, an improved downward share scheme is adopted to increase diversification of the population, and thus alleviate the premature convergence. Extensive experiments based on benchmark instances with different scales are carried out and comparisons with other recent algorithms identify the effectiveness of the proposed hyABC.     

An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times

This study deals with a sequence-dependent disassembly line balancing problem by considering the interactions among disassembly tasks, and a multi-objective mathematical model is established. Subsequently, a novel hybrid artificial bee colony algorithm is proposed to solve the problem. A new rule is used to initialize a bee colony population with certain diversity, and a dynamic neighbourhood search method is introduced to guide the employed/onlooker bees to promising regions. To rapidly leave the local optima, a global learning strategy is employed to explore higher quality solutions. In addition, a multi-stage evaluation method is designed for onlookers to effectively select employed bees to follow. The performance of the proposed algorithm is tested on a set of benchmark instances and two case scenarios, and the results are compared with several other metaheuristics in terms of solution quality and computation time. The comparisons demonstrate that the proposed algorithm exhibits superior performance.     

A novel cloud manufacturing service composition platform enabled by Blockchain technology

In the near future, manufacturing industries will be mostly recognised with characteristics like IoT, and massive data transactions. To fulfil these characteristics, paradigms like Cloud manufacturing, Industry 4.0 and smart factory have passed their preliminary steps to become the primary inspirations. Considering the nature of Cloud manufacturing which consists of a vast number of service providers and Service demanders being introduced to the manufacturing cloud, service composition problem is introduced. However, there is a big challenge for fulfilling the dynamic behaviour of parameters which change rapidly over time in the service composition problem. This paper challenges the centralised mechanism of service composition problem and introduces a novel platform entitled Blockchain-based service composition model (Block-SC) based on the Blockchain technology. Block-SC as a novel manufacturing architecture conquers the centralised mechanism by dividing the original service composition problem into multiple sub-problems each of which contains a small fraction of the service/task pool. The capabilities of the proposed platform are remarkable from two perspectives; first, it provides an effective mechanism for collaboration of service composition service providers with a service-oriented approach and from the second perspective, the optimality of service composition problem is profoundly affected considering the dynamic behaviour of Cloud manufacturing.     

Improved artificial bee colony algorithm for crack identification in beam using natural frequencies only

An improved artificial bee colony algorithm (I-ABC) is proposed for crack identification in beam structures. ABC is a heuristic algorithm and swarm technique with simple structure, which is easy to implement but with slow convergence rate. In the I-ABC, the differential evolution (DE) mechanism is introduced to employed bee phase, roulette selection strategy is replaced by tournament selection strategy and a new formula is used to simulate onlooker bee’s behaviour. A discrete open crack is used for vibration analysis of the cracked beam and only the changes in the first few natural frequencies are utilized to establish the objective function of the optimization problem for crack identification. A numerical simulation and an experimental work are studied to illustrate the efficiency of the proposed method. Studies show that the present techniques can produce more accurate damage identification results when compared with original ABC, DE algorithm, particle swarm optimization and genetic algorithm.     

An artificial bee colony algorithm for the economic lot scheduling problem

In this study, we present an artificial bee colony (ABC) algorithm for the economic lot scheduling problem modelled through the extended basic period (EBP) approach. We allow both power-of-two (PoT) and non-power-of-two multipliers in the solution representation. We develop mutation strategies to generate neighbouring food sources for the ABC algorithm and these strategies are also used to develop two different variable neighbourhood search algorithms to further enhance the solution quality. Our algorithm maintains both feasible and infeasible solutions in the population through the use of some sophisticated constraint handling methods. Experimental results show that the proposed algorithm succeeds to find the all the best-known EBP solutions for the high utilisation 10-item benchmark problems and improves the best known solutions for two of the six low utilisation 10-item benchmark problems. In addition, we develop a new problem instance with 50 items and run it at different utilisation levels ranging from 50 to 99% to see the effectiveness of the proposed algorithm on large instances. We show that the proposed ABC algorithm with mixed solution representation outperforms the ABC that is restricted only to PoT multipliers at almost all utilisation levels of the large instance.     

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.     

Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling m-machine flow shops lot streaming with equal size sub-lot problems

The objective of this paper is to develop intelligent search heuristics to solve n-jobs, m-machines lot streaming problem in a flow shop with equal size sub-lots where the objective is to minimise makespan and total flow time independently. Improved sheep flock heredity algorithm (ISFHA) and artificial bee colony (ABC) algorithms are applied to the problem above mentioned. The performance of these algorithms is evaluated against the algorithms reported in the literature. The computational analysis shows the better performance of ISFHA and ABC algorithms.     

A novel model for optimisation of logistics and manufacturing operation service composition in Cloud manufacturing system focusing on cloud-entropy

In recent years, economic globalisation and manufacturing resource globalisation as two key factors have driven enterprises to transform their business processes to survive in competitive environments. This transformation is challenging as manufacturing enterprises should maintain their support for their customers with high-quality products, lower cost, product customisation capabilities, and quick delivery. Moreover, globalisation has resulted in geographically distributed suppliers across the globe. This challenge will turn into a major research topic when paradigms like Cloud manufacturing are introduced. Cloud manufacturing is a new paradigm which provides ubiquitous, convenient, on-demand network access to a shared pool of configurable manufacturing resources. In this paper, to achieve the ideal goal of Cloud manufacturing, the concept of supplier network logistics planning and manufacturing service composition is focused. Every production task and logistics operation would be defined as a service considering operation process chart flows. The paper has proposed a mathematical model which selects an optimal set of manufacturing and logistics service composition in order to lower operation and logistics costs in operational perspective while fulfilling a novel idea for configured cloud entropy of logistics and operation suppliers. Finally, the paper has presented a numerical example and concluded the remarks, and outlined future research.     

一种QoS感知的语义Web服务组合群决策算法

针对QoS信息不确定和存在多个决策者的语义Web服务组合问题,基于多属性群决策理论给出了一个自治的语义Web服务组合群决策算法(AGSC).该算法能够对以实数型、区间型和语言型数据描述的复杂的QoS信息进行综合评估,从而为多客户提供正确、高效的决策支持,为其优选出最佳的组合服务执行计划.利用真实Web服务的质量对该算法进行了实验验证,结果表明该算法具有优秀的决策灵敏性和稳定性,并能有效地反映决策群中个体角色的变化.