What is it about?

This study focuses on the integration of process planning, scheduling, and due date assignment in manufacturing systems. It introduces the concept of Dynamic Integrated Process Planning, Scheduling, and Due Date Assignment (DIPPSDDA) to address the challenges of job arrival in real-time. The objective is to minimize earliness and tardiness while determining optimal due dates for each job. Different metaheuristic algorithms, including genetic algorithm, tabu algorithm, and simulated annealing, are developed and compared to optimize DIPPSDDA on various shop floors. The study provides insights into improving the global performance of manufacturing systems by considering the interrelated nature of these functions.

Featured Image

Why is it important?

Process planning, scheduling, due date assignment manufacturing functions are integrated and solved simultaneously combined with dynamically changing job arrivals to make more realistic job shop scheduling model. Practically useful meta-heuristic algorithms are proposed for DIPPSDDA. Job assignments are controlled by applying discrete event simulation. Number of crossover and mutation points are not fixed. They are adjusted proportionally to chromosome length to get better algorithm performances.


The study offers several perspectives for future research and application. Firstly, it opens up possibilities for further exploring the integration of process planning, scheduling, and due date assignment in dynamic manufacturing environments. Researchers can delve into more advanced algorithms and optimization techniques to improve the performance of DIPPSDDA. Additionally, the use of hybrid algorithms, such as GA/SA and GA/TA, can be further investigated to find optimal solutions. Furthermore, the study highlights the importance of considering real-time job arrival and dynamic events in manufacturing systems. Future research can focus on developing models and algorithms that effectively handle unexpected changes and disruptions in the production process. This could involve incorporating machine learning or artificial intelligence techniques to enhance adaptability and decision-making in DIPPSDDA problems. The findings of this study can also be applied in practical manufacturing settings. Manufacturers can benefit from the insights provided to enhance their process planning, scheduling, and due date assignment strategies. Implementing the proposed metaheuristic algorithms and optimization techniques can lead to improved efficiency, reduced earliness and tardiness, and better utilization of resources. This can ultimately result in cost savings and enhanced customer satisfaction. Overall, the study sets a foundation for future research to advance the field of integrated process planning, scheduling, and due date assignment. It offers valuable perspectives for exploring new algorithms, addressing dynamic manufacturing challenges, and applying the findings to optimize real-world manufacturing systems.

Dr. Caner Erden
Sakarya University of Applied Sciences

Read the Original

This page is a summary of: Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms, Mathematical Problems in Engineering, May 2019, Hindawi Publishing Corporation, DOI: 10.1155/2019/1572614.
You can read the full text:

Open access logo



The following have contributed to this page