Abstract—Conventionally process planning, scheduling and due-date assignment are performed independently. But treating these three functions simultaneously improves global performance. In literature there are numerous works on process planning and scheduling and on scheduling with due-date assignment. But integrating these three functions are not treated much. In this study, process planning and due-date assignment are simultaneously treated with ATC dispatching using genetic algorithm (genetic search) and random search. Three shop floors are tested in this study. One is small shop floor with 50 jobs and the other is medium shop floor with 100 jobs and the third one is the largest shop floor with 200 jobs. In this study Earliness and Tardiness symmetrically and quadratically penalized and length of due-date is linearly punished. Results of Genetic search and Random search are compared with each other and with random solution and with unintegrated solution. Results are summarized and compared with each other. According to results Genetic search-integrated solution is the best, Random search-integrated solution is the second, Random-integrated solution is the third and Unintegrated-random solution is the poorest.

Index Terms—Due-date assignment, Process planning, Job shop scheduling, Genetic Algorithm

Cite: Halil Ibrahim Demir, Tarık Cakar, Mumtaz Ipek, Ozer Uygun, and Murat Sari, "Process Planning and Due-date Assignment with ATC Dispatching where Earliness, Tardiness and Due-dates are Punished," Journal of Industrial and Intelligent Information, Vol. 3, No. 3, pp. 197-204, September 2015. doi: 10.12720/jiii.3.3.197-204