The Job Shop Scheduling Problem (JSSP) has enormous industrial applicability. This problem refers to a set of jobs that should be processed in specific order using machines. For the single-objective optimization JSSP problem, Simulated Annealing is among best algorithms. However, Multi-Objective (MOJSSP), these algorithms have barely been analyzed, and Threshold Accepting Algorithm not publishe...

With the rapid development of sensor technology and mobile services, service model crowd sensing (MCS) has emerged. In this model, user groups perceive data through carried terminal devices, thereby completing large-scale distributed tasks. Task allocation is an important link in MCS, but interests task publishers, users, platforms often conflict. Therefore, to improve performance MCS allocatio...

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

Abstract The integration of Internet Things devices onto the Blockchain implies an increase in transactions that occur on Blockchain, thus increasing storage requirements. A solution approach is to leverage cloud resources for storing blocks within chain. paper, therefore, proposes two solutions this problem. first being improved hybrid architecture design which uses containerization create a s...

The near net shaped manufacturing ability of squeeze casting process requiresto set the process variable combinations at their optimal levels to obtain both aesthetic appearance and internal soundness of the cast parts. The aesthetic and internal soundness of cast parts deal with surface roughness and tensile strength those can readily put the part in service without the requirement of costly s...