An Improved Sparrow Search Algorithm for Solving the Energy-Saving Flexible Job Shop Scheduling Problem
نویسندگان
چکیده
Due to emerging requirements and pressures related environmental protection, manufacturing enterprises have expressed growing concern for adopting various energy-saving strategies. However, criteria were usually not considered in traditional production scheduling problems. To overcome this deficiency, has drawn more attention from academic scholars industrial practitioners. In paper, an flexible job shop problem (EFJSP) is introduced accordance with the criterion of optimizing power consumption processing costs simultaneously. Since classical FJSP strongly NP-hard, Improved Sparrow Search Algorithm (ISSA) developed efficiently solving EFJSP. ISSA, a Hybrid (HS) method used produce initial high-quality population; Quantum Rotation Gate (QRG) Sine–Cosine (SCA) are integrated intensify ability ISSA coordinate exploration exploitation; adaptive adjustment strategy Variable Neighborhood (VNS) applied strengthen diversification move away local optima. Extensive computational experiments validate that outperforms other existing algorithms EFJSP due advantages intensification mechanisms ISSA.
منابع مشابه
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولsolving flexible job-shop scheduling problem using hybrid algorithm based on gravitational search algorithm and particle swarm optimization
job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...
متن کاملAn Efficient Algorithm for Solving the Flexible Job Shop Scheduling Problem
Purpose To investigate the efficiency of a discretization procedure utilizing a time-indexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising makespan and tardiness, respectively. Design/methodology/approach A time-indexed mixed integer programming model is used to find solutions by iteratively employing ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machines
سال: 2022
ISSN: ['2075-1702']
DOI: https://doi.org/10.3390/machines10100847