Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms

Abstract EN

Because the alternative process plans have significant contributions to the production efficiency of a manufacturing system, researchers have studied the integration of manufacturing functions, which can be divided into two groups, namely, integrated process planning and scheduling (IPPS) and scheduling with due date assignment (SWDDA).

Although IPPS and SWDDA are well-known and solved problems in the literature, there are limited works on integration of process planning, scheduling, and due date assignment (IPPSDDA).

In this study, due date assignment function was added to IPPS in a dynamic manufacturing environment.

And the studied problem was introduced as dynamic integrated process planning, scheduling, and due date assignment (DIPPSDDA).

The objective function of DIPPSDDA is to minimize earliness and tardiness (E/T) and determine due dates for each job.

Furthermore, four different pure metaheuristic algorithms which are genetic algorithm (GA), tabu algorithm (TA), simulated annealing (SA), and their hybrid (combination) algorithms GA/SA and GA/TA have been developed to facilitate and optimize DIPPSDDA on the 8 different sized shop floors.

The performance comparisons of the algorithms for each shop floor have been given to show the efficiency and effectiveness of the algorithms used.

In conclusion, computational results show that the proposed combination algorithms are competitive, give better results than pure metaheuristics, and can effectively generate good solutions for DIPPSDDA problems.