Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished
Halil Ibrahim Demir, Ozer Uygun, Ibrahim Cil, Mumtaz Ipek, and Meral Sari
Industrial Engineering Department, Sakarya University, Sakarya, Turkey
Abstract—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.
Index Terms—process planning, scheduling, due-date assignment, genetic algorithm, random search
Cite: Halil Ibrahim Demir, Ozer Uygun, Ibrahim Cil, Mumtaz Ipek, and Meral Sari, "Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished," Journal of Industrial and Intelligent Information, Vol. 3, No. 3, pp. 173-180, September 2015. doi: 10.12720/jiii.3.3.173-180
Index Terms—process planning, scheduling, due-date assignment, genetic algorithm, random search
Cite: Halil Ibrahim Demir, Ozer Uygun, Ibrahim Cil, Mumtaz Ipek, and Meral Sari, "Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished," Journal of Industrial and Intelligent Information, Vol. 3, No. 3, pp. 173-180, September 2015. doi: 10.12720/jiii.3.3.173-180
Previous paper:First page
Next paper:Scheduling Analysis for Job Sequencing in Veneer Lamination Line
Next paper:Scheduling Analysis for Job Sequencing in Veneer Lamination Line