Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (170)
  • Open Access

    ARTICLE

    A Novel Collaborative Evolutionary Algorithm with Two-Population for Multi-Objective Flexible Job Shop Scheduling

    Cuiyu Wang, Xinyu Li, Yiping Gao*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1849-1870, 2023, DOI:10.32604/cmes.2023.028098

    Abstract Job shop scheduling (JS) is an important technology for modern manufacturing. Flexible job shop scheduling (FJS) is critical in JS, and it has been widely employed in many industries, including aerospace and energy. FJS enables any machine from a certain set to handle an operation, and this is an NP-hard problem. Furthermore, due to the requirements in real-world cases, multi-objective FJS is increasingly widespread, thus increasing the challenge of solving the FJS problems. As a result, it is necessary to develop a novel method to address this challenge. To achieve this goal, a novel collaborative evolutionary algorithm with two-population based… More >

  • Open Access

    ARTICLE

    An Effective Neighborhood Solution Clipping Method for Large-Scale Job Shop Scheduling Problem

    Sihan Wang, Xinyu Li, Qihao Liu*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1871-1890, 2023, DOI:10.32604/cmes.2023.028339

    Abstract The job shop scheduling problem (JSSP) is a classical combinatorial optimization problem that exists widely in diverse scenarios of manufacturing systems. It is a well-known NP-hard problem, when the number of jobs increases, the difficulty of solving the problem exponentially increases. Therefore, a major challenge is to increase the solving efficiency of current algorithms. Modifying the neighborhood structure of the solutions can effectively improve the local search ability and efficiency. In this paper, a genetic Tabu search algorithm with neighborhood clipping (GTS_NC) is proposed for solving JSSP. A neighborhood solution clipping method is developed and embedded into Tabu search to… More >

  • Open Access

    ARTICLE

    A Multi-Object Genetic Algorithm for the Assembly Line Balance Optimization in Garment Flexible Job Shop Scheduling

    Junru Liu, Yonggui Lv*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2421-2439, 2023, DOI:10.32604/iasc.2023.040262

    Abstract Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations. As a result, the production efficiency of the enterprise is not high, and the production organization is not up to expectations. Aiming at the problem of flexible process route planning in garment workshops, a multi-object genetic algorithm is proposed to solve the assembly line balance optimization problem and minimize the machine adjustment path. The encoding method adopts the object-oriented path representation method, and the initial population is generated by random topology sorting based on an in-degree selection mechanism.… More >

  • Open Access

    ARTICLE

    Competitive and Cooperative-Based Strength Pareto Evolutionary Algorithm for Green Distributed Heterogeneous Flow Shop Scheduling

    Kuihua Huang1, Rui Li2, Wenyin Gong2,*, Weiwei Bian3, Rui Wang1

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2077-2101, 2023, DOI:10.32604/iasc.2023.040215

    Abstract This work aims to resolve the distributed heterogeneous permutation flow shop scheduling problem (DHPFSP) with minimizing makespan and total energy consumption (TEC). To solve this NP-hard problem, this work proposed a competitive and cooperative-based strength Pareto evolutionary algorithm (CCSPEA) which contains the following features: 1) An initialization based on three heuristic rules is developed to generate a population with great diversity and convergence. 2) A comprehensive metric combining convergence and diversity metrics is used to better represent the heuristic information of a solution. 3) A competitive selection is designed which divides the population into a winner and a loser swarms… More >

  • Open Access

    ARTICLE

    Hyper-Heuristic Task Scheduling Algorithm Based on Reinforcement Learning in Cloud Computing

    Lei Yin1, Chang Sun2, Ming Gao3, Yadong Fang4, Ming Li1, Fengyu Zhou1,*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1587-1608, 2023, DOI:10.32604/iasc.2023.039380

    Abstract The solution strategy of the heuristic algorithm is pre-set and has good performance in the conventional cloud resource scheduling process. However, for complex and dynamic cloud service scheduling tasks, due to the difference in service attributes, the solution efficiency of a single strategy is low for such problems. In this paper, we presents a hyper-heuristic algorithm based on reinforcement learning (HHRL) to optimize the completion time of the task sequence. Firstly, In the reward table setting stage of HHRL, we introduce population diversity and integrate maximum time to comprehensively determine the task scheduling and the selection of low-level heuristic strategies.… More >

  • Open Access

    ARTICLE

    Urban Drainage Network Scheduling Strategy Based on Dynamic Regulation: Optimization Model and Theoretical Research

    Xiaoming Fei*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1293-1309, 2023, DOI:10.32604/iasc.2023.038607

    Abstract With the acceleration of urbanization in China, the discharge of domestic sewage and industrial wastewater is increasing, and accidents of sewage spilling out and polluting the environment occur from time to time. Problems such as imperfect facilities and backward control methods are common in the urban drainage network systems in China. Efficient drainage not only strengthens infrastructure such as rain and sewage diversion, pollution source monitoring, transportation, drainage and storage but also urgently needs technical means to monitor and optimize production and operation. Aiming at the optimal control of single-stage pumping stations and the coordinated control between two-stage pumping stations,… More >

  • Open Access

    ARTICLE

    An OP-TEE Energy-Efficient Task Scheduling Approach Based on Mobile Application Characteristics

    Hai Wang*, Xuan Hao, Shuo Ji*, Jie Zheng, Yuhui Ma, Jianfeng Yang

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1621-1635, 2023, DOI:10.32604/iasc.2023.037898

    Abstract Trusted Execution Environment (TEE) is an important part of the security architecture of modern mobile devices, but its secure interaction process brings extra computing burden to mobile devices. This paper takes open portable trusted execution environment (OP-TEE) as the research object and deploys it to Raspberry Pi 3B, designs and implements a benchmark for OP-TEE, and analyzes its program characteristics. Furthermore, the application execution time, energy consumption and energy-delay product (EDP) are taken as the optimization objectives, and the central processing unit (CPU) frequency scheduling strategy of mobile devices is dynamically adjusted according to the characteristics of different applications through… More >

  • Open Access

    ARTICLE

    Non-Cooperative Game of Coordinated Scheduling of Parallel Machine Production and Transportation in Shared Manufacturing

    Peng Liu1,*, Ke Xu1,2, Hua Gong1,2

    CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 239-258, 2023, DOI:10.32604/cmc.2023.038232

    Abstract Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry, the coordinated scheduling problem of parallel machine production and transportation is investigated. The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance. A non-cooperative game model is established, considering the competition and self-interest behavior of jobs from different customers for machine resources. The job from different customers is mapped to the players in the game model, the corresponding optional processing machine and location are mapped to the strategy set, and the makespan… More >

  • Open Access

    ARTICLE

    The Cloud Manufacturing Resource Scheduling Optimization Method Based on Game Theory

    Xiaoxuan Yang*, Zhou Fang

    Journal on Artificial Intelligence, Vol.4, No.4, pp. 229-243, 2022, DOI:10.32604/jai.2022.035368

    Abstract In order to optimize resource integration and optimal scheduling problems in the cloud manufacturing environment, this paper proposes to use load balancing, service cost and service quality as optimization goals for resource scheduling, however, resource providers have resource utilization requirements for cloud manufacturing platforms. In the process of resource optimization scheduling, the interests of all parties have conflicts of interest, which makes it impossible to obtain better optimization results for resource scheduling. Therefore, a multithreaded auto-negotiation method based on the Stackelberg game is proposed to resolve conflicts of interest in the process of resource scheduling. The cloud manufacturing platform first… More >

  • Open Access

    ARTICLE

    Reliable Scheduling Method for Sensitive Power Business Based on Deep Reinforcement Learning

    Shen Guo*, Jiaying Lin, Shuaitao Bai, Jichuan Zhang, Peng Wang

    Intelligent Automation & Soft Computing, Vol.37, No.1, pp. 1053-1066, 2023, DOI:10.32604/iasc.2023.038332

    Abstract The main function of the power communication business is to monitor, control and manage the power communication network to ensure normal and stable operation of the power communication network. Communication services related to dispatching data networks and the transmission of fault information or feeder automation have high requirements for delay. If processing time is prolonged, a power business cascade reaction may be triggered. In order to solve the above problems, this paper establishes an edge object-linked agent business deployment model for power communication network to unify the management of data collection, resource allocation and task scheduling within the system, realizes… More >

Displaying 21-30 on page 3 of 170. Per Page