Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

    Zhaolin Lv1, Yuexia Zhao2, Hongyue Kang3,*, Zhenyu Gao3, Yuhang Qin4

    CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2337-2360, 2024, DOI:10.32604/cmc.2023.045826

    Abstract Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize… More >

  • Open Access


    Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm

    Qinhui Liu, Laizheng Zhu, Zhijie Gao, Jilong Wang, Jiang Li*

    CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 811-843, 2024, DOI:10.32604/cmc.2023.046040

    Abstract To improve the productivity, the resource utilization and reduce the production cost of flexible job shops, this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching. Firstly, a mathematical model is established to minimize the maximum completion time. Secondly, an improved two-layer optimization algorithm is designed: the outer layer algorithm uses an improved PSO (Particle Swarm Optimization) to solve the workpiece batching problem, and the inner layer algorithm uses an improved GA (Genetic Algorithm) to solve the dual-resource scheduling problem. Then, a rescheduling method is designed to solve the… More >

  • Open Access


    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


    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


    Research on Flexible Job Shop Scheduling Optimization Based on Segmented AGV

    Qinhui Liu1, Nengjian Wang1,*, Jiang Li1, Tongtong Ma2, Fapeng Li1, Zhijie Gao1

    CMES-Computer Modeling in Engineering & Sciences, Vol.134, No.3, pp. 2073-2091, 2023, DOI:10.32604/cmes.2022.021433

    Abstract As a typical transportation tool in the intelligent manufacturing system, Automatic Guided Vehicle (AGV) plays an indispensable role in the automatic production process of the workshop. Therefore, integrating AGV resources into production scheduling has become a research hotspot. For the scheduling problem of the flexible job shop adopting segmented AGV, a dual-resource scheduling optimization mathematical model of machine tools and AGVs is established by minimizing the maximum completion time as the objective function, and an improved genetic algorithm is designed to solve the problem in this study. The algorithm designs a two-layer coding method based on process coding and machine… More > Graphic Abstract

    Research on Flexible Job Shop Scheduling Optimization Based on Segmented AGV

  • Open Access


    A Dynamic Adaptive Firefly Algorithm for Flexible Job Shop Scheduling

    K. Gayathri Devi*, R. S. Mishra, A. K. Madan

    Intelligent Automation & Soft Computing, Vol.31, No.1, pp. 429-448, 2022, DOI:10.32604/iasc.2022.019330

    Abstract An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires more computational effort to optimize the objectives with contradictory measures. This paper aims to address the FJSP problem with combined and contradictory objectives, like minimization of make-span, maximum workload, and total workload. This paper proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version of the classic Firefly Algorithm (FA) embedded with adaptive parameters to optimize the multi objectives concurrently. The proposed algorithm has adopted two adaptive strategies, i.e., an adaptive randomization parameter (α) and an effective heterogeneous update rule for fireflies. The adaptations… More >

  • Open Access


    Scheduling Optimization Modelling: A Case Study of a Woven Label Manufacturing Company

    Chia-Nan Wang1, Zhao-Hong Cheng2,*, Nguyen Ky Phuc Phan3, Van Thanh Nguyen4

    Computer Systems Science and Engineering, Vol.38, No.2, pp. 239-249, 2021, DOI:10.32604/csse.2021.016578

    Abstract Production scheduling involves all activities of building production schedules, including coordinating and assigning activities to each person, group of people, or machine and arranging work orders in each workplace. Production scheduling must solve all problems such as minimizing customer wait time, storage costs, and production time; and effectively using the enterprise’s human resources. This paper studies the application of flexible job shop modelling on scheduling a woven labelling process. The labelling process includes several steps which are handled in different work-stations. Each workstation is also comprised of several identical parallel machines. In this study, job splitting is allowed so that… More >

Displaying 1-10 on page 1 of 7. Per Page