Optimizing integrated planning, scheduling, and due date assignment using a modified PSO.

What is it about?

The study focuses on solving the dynamic integrated process planning, scheduling, and due date assignment (DIPPSDDA) problem using a modified version of the integer and categorical Particle Swarm Optimization (PSO) algorithm. DIPPSDDA combines the integrated process planning and scheduling (IPPS) problem with the scheduling with due date assignment (SWDDA) problem, adding the due date assignment function to the integrated system. The objective is to minimize earliness, tardiness, and the length of given due dates. The authors applied the ICPSO algorithm, which uses probability distributions instead of solution values, to solve the DIPPSDDA problem. However, the experimental results showed that ICPSO did not find better solutions. To enhance the algorithm's performance, the researchers incorporated crossover and mutation operators from genetic algorithms into ICPSO, creating a modified ICPSO (MICPSO). The study's importance lies in addressing a complex and integrated manufacturing problem that involves multiple functions and a dynamic environment. By developing and improving optimization algorithms for DIPPSDDA, the study contributes to advancing manufacturing efficiency and performance. The proposed MICPSO algorithm provides better results compared to genetic algorithms, ICPSO, and modified discrete PSO, demonstrating its potential for solving the DIPPSDDA problem effectively. Overall, this research offers a valuable approach to optimizing the integrated process planning, scheduling, and due date assignment in manufacturing systems, aiming to minimize earliness, tardiness, and due date-related costs. The findings can benefit industries by improving their decision-making processes and enhancing overall manufacturing performance.

Featured Image

Photo by Ricardo Gomez Angel on Unsplash

Photo by Ricardo Gomez Angel on Unsplash

Why is it important?

The study is important because it addresses the challenge of optimizing manufacturing processes by integrating process planning, scheduling, and due date assignment. By using a modified PSO algorithm, the study aims to improve the efficiency and effectiveness of these integrated tasks. This is crucial for manufacturing companies as it can lead to reduced production time, improved on-time delivery, and better resource utilization. The study contributes to the field by proposing a solution to the dynamic nature of the problem, where jobs arrive randomly, and by minimizing earliness, tardiness, and due date lengths. The findings provide insights into the performance of the modified PSO algorithm and highlight its superiority compared to other approaches, such as genetic algorithms and standard PSO. Ultimately, the study's results can benefit manufacturing practitioners and researchers seeking to optimize their production processes and achieve better overall manufacturing performance.

Perspectives