Solving Task Scheduling Problem in Cloud Computing Environment Using Orthogonal Taguchi-Cat Algorithm

In cloud computing datacenter, task execution delay is no longer accidental. In recent times, a number of artificial intelligence scheduling techniques are proposed and applied to reduce task execution delay. In this study, we proposed an algorithm called Orthogonal Taguchi Based-Cat Swarm Optimization (OTB-CSO) to minimize total task execution time. In our proposed algorithm Taguchi Orthogonal approach was incorporated at CSO tracing mode for best task mapping on VMs with minimum execution time. The proposed algorithm was implemented on CloudSim tool and evaluated based on makespan metric. Experimental results showed for 20VMs used, proposed OTB-CSO was able to minimize makespan of total tasks scheduled across VMs with 42.86%, 34.57% and 2.58% improvement over Minimum and Maximum Job First (Min-Max), Particle Swarm Optimization with Linear Descending Inertia Weight (PSO-LDIW) and Hybrid Particle Swarm Optimization with Simulated Annealing (HPSO-SA) algorithms. Results obtained showed OTB-CSO is effective to optimize task scheduling and improve overall cloud computing performance with better system utilization

Scheduling Algorithms: Challenges Towards Smart Manufacturing

Collecting, processing, analyzing, and driving knowledge from large-scale real-time data is now realized with the emergence of Artificial Intelligence (AI) and Deep Learning (DL). The breakthrough of Industry 4.0 lays a foundation for intelligent manufacturing. However, implementation challenges of scheduling algorithms in the context of smart manufacturing are not yet comprehensively studied. The purpose of this study is to show the scheduling No.s that need to be considered in the smart manufacturing paradigm. To attain this objective, the literature review is conducted in five stages using publish or perish tools from different sources such as Scopus, Pubmed, Crossref, and Google Scholar. As a result, the first contribution of this study is a critical analysis of existing production scheduling algorithms\u27 characteristics and limitations from the viewpoint of smart manufacturing. The other contribution is to suggest the best strategies for selecting scheduling algorithms in a real-world scenario

Solving a flow shop scheduling problem with missing operations in an Industry 4.0 production environment

Industry 4.0 is a modern approach that aims at enhancing the connectivity between the different stages of the production process and the requirements of consumers. This paper addresses a relevant problem for both Industry 4.0 and flow shop literature: the missing operations flow shop scheduling problem. In general, in order to reduce the computational effort required to solve flow shop scheduling problems only permutation schedules (PFS) are considered, i.e., the same job sequence is used for all the machines involved. However, considering only PFS is not a constraint that is based on the real-world conditions of the industrial environments, and it is only a simplification strategy used frequently in the literature. Moreover, non-permutation (NPFS) orderings may be used for most of the real flow shop systems, i.e., different job schedules can be used for different machines in the production line, since NPFS solutions usually outperform the PFS ones. In this work, a novel mathematical formulation to minimize total tardiness and a resolution method, which considers both PFS and (the more computationally expensive) NPFS solutions, are presented to solve the flow shop scheduling problem with missing operations. The solution approach has two stages. First, a Genetic Algorithm, which only considers PFS solutions, is applied to solve the scheduling problem. The resulting solution is then improved in the second stage by means of a Simulated Annealing algorithm that expands the search space by considering NPFS solutions. The experimental tests were performed on a set of instances considering varying proportions of missing operations, as it is usual in the Industry 4.0 production environment. The results show that NPFS solutions clearly outperform PFS solutions for this problem.Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Toncovich, Adrián Andrés. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Rossit, Diego Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; ArgentinaFil: Nesmachnow, Sergio. Facultad de Ingeniería; Urugua

Smart manufacturing scheduling: A literature review

[EN] Within the scheduling framework, the potential of digital twin (DT) technology, based on virtualisation and intelligent algorithms to simulate and optimise manufacturing, enables an interaction with processes and modifies their course of action in time synchrony in the event of disruptive events. This is a valuable capability for automating scheduling and confers it autonomy. Automatic and autonomous scheduling management can be encouraged by promoting the elimination of disruptions due to the appearance of defects, regardless of their origin. Hence the zero-defect manufacturing (ZDM) management model oriented towards zero-disturbance and zero-disruption objectives has barely been studied. Both strategies combine the optimisation of production processes by implementing DTs and promoting ZDM objectives to facilitate the modelling of automatic and autonomous scheduling systems. In this context, this particular vision of the scheduling process is called smart manufacturing scheduling (SMS). The aim of this paper is to review the existing scientific literature on the scheduling problem that considers the DT technology approach and the ZDM model to achieve self-management and reduce or eliminate the need for human intervention. Specifically, 68 research articles were identified and analysed. The main results of this paper are to: (i) find methodological trends to approach SMS models, where three trends were identified; i.e. using DT technology and the ZDM model, utilising other enabling digital technologies and incorporating inherent SMS capabilities into scheduling; (ii) present the main SMS alignment axes of each methodological trend; (iii) provide a map to classify the literature that comes the closest to the SMS concept; (iv) discuss the main findings and research gaps identified by this study. Finally, managerial implications and opportunities for further research are identified.This work was supported by the Spanish Ministry of Science, Innovation and Universities project entitled 'Optimisation of zero-defects production technologies enabling supply chains 4.0 (CADS4.0) ' (RTI2018-101344-B-I00) , the European Union H2020 research and innovation programme with grant agreement No. 825631 "Zero Defect Manufacturing Platform (ZDMP) " and the European Union H2020 research and innovation programme with agreement No. 958205 "In-dustrial Data Services for Quality Control in Smart Manufacturing (i4Q) ".Serrano-Ruiz, JC.; Mula, J.; Poler, R. (2021). Smart manufacturing scheduling: A literature review. Journal of Manufacturing Systems. 61:265-287. https://doi.org/10.1016/j.jmsy.2021.09.0112652876

Cloud manufacturing – scheduling as a service for sheet metal manufacturing

Cloud manufacturing refers to a new concept of using centralized cloud computing for manufacturing information systems to support distributed and dynamic collaborative manufacturing environment. The core of cloud manufacturing is to provide service to geographically distributed manufacturers centralized services. This paper introduces a cloud based production scheduling system for sheet metal manufacturing and discusses the requirements of scheduling as a service. A genetic algorithm based scheduling application has been developed to serve distributed manufacturing lines in form of cloud manufacturing. The characteristics of the prototype system are described and performance estimates are tested.fi=vertaisarvioitu|en=peerReviewed

A Memetic Algorithm with Reinforcement Learning for Sociotechnical Production Scheduling

The following interdisciplinary article presents a memetic algorithm with applying deep reinforcement learning (DRL) for solving practically oriented dual resource constrained flexible job shop scheduling problems (DRC-FJSSP). From research projects in industry, we recognize the need to consider flexible machines, flexible human workers, worker capabilities, setup and processing operations, material arrival times, complex job paths with parallel tasks for bill of material (BOM) manufacturing, sequence-dependent setup times and (partially) automated tasks in human-machine-collaboration. In recent years, there has been extensive research on metaheuristics and DRL techniques but focused on simple scheduling environments. However, there are few approaches combining metaheuristics and DRL to generate schedules more reliably and efficiently. In this paper, we first formulate a DRC-FJSSP to map complex industry requirements beyond traditional job shop models. Then we propose a scheduling framework integrating a discrete event simulation (DES) for schedule evaluation, considering parallel computing and multicriteria optimization. Here, a memetic algorithm is enriched with DRL to improve sequencing and assignment decisions. Through numerical experiments with real-world production data, we confirm that the framework generates feasible schedules efficiently and reliably for a balanced optimization of makespan (MS) and total tardiness (TT). Utilizing DRL instead of random metaheuristic operations leads to better results in fewer algorithm iterations and outperforms traditional approaches in such complex environments.Comment: This article has been accepted by IEEE Access on June 30, 202