ABSTRACT
Although IPPS (integrated process planning and scheduling) and SWDDA (scheduling with due-date assignment) problems are widely studied in the literature, the integration of the three important manufacturing functions of process planning, scheduling, and due-date assignment (IPPSDDA) is a relatively new research topic, unfortunately, with some exceptions, has not been studied. This problem is a higher level of integration, and more global performance can be achieved with this integration. Because shop floor scheduling is an NP-hard problem alone, the problems of IPPS, SWDDA, IPPSDDA, and even dynamic IPPSDDA (DIPPSDDA) are more complex to solve. Although only small-sized problems in these areas can be solved with the mathematical model, it is appropriate to use common metaheuristics for large problems. The IPPSDDA problem, especially the DIPPSDDA problem, is quite new and a field that is open to much research.
