Traditionally process planning, scheduling and due date assignment are treated separately. Some works are done on integrated process planning and scheduling and on scheduling with due-date assignment. However integrating all of these functions is not treated. Since scheduling problems alone belong to NP-hard class problems, integrated problems are even harder to solve. In this study process planning and scheduling and SLK due date assignment are integrated using genetic algorithms and Random search techniques. Earliness, Tardiness and length of due-dates are punished. While earliness and tardiness are punished quadratically, due-date is punished linearly. Three results were compared. One is ordinary solution, another one is random search solution and the third one is genetic algorithm solution. Genetic algorithm solution outperforms the other solutions and Random search solution is the second best and ordinary solution is the worst solution. 1
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.