Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished

Author(s):  
Halil Ibrahim Demir ◽  
Ozer Uygun ◽  
Ibrahim Cil ◽  
Mumtaz Ipek ◽  
Meral Sari
Author(s):  
Halil Ibrahim Demir ◽  
Onur Canpolat

Process planning, scheduling and due-date assignment are three important manufacturing functions in our life. They all try to get local optima and there can be enormous loss in overall performance value if they are handled separately. That is why they should be handled concurrently. Although integrated process planning and scheduling with due date assignment problem is not addressed much in the literature, there are numerous works on integrated process planning and scheduling and many works on scheduling with due date assignment. Most of the works in the literature assign common due date for the jobs waiting and due dates are determined without taking into account of the weights of the customers. Here process planning function is integrated with weighted shortest processing times (WSPT) scheduling and weighted slack (WSLK) due date assignment. In this study unique due dates are given to each customer and important customers gets closer due dates. Integration of these three functions is tested for different levels of integration with genetic algorithms, evolutionary strategies, hybrid genetic algorithms, hybrid evolutionary strategies and random search techniques. Best combinations are found as full integration with genetic search and hybrid genetic search. Integration of these three functions provided substantial improvements in global performance.


2019 ◽  
Vol 2019 ◽  
pp. 1-19 ◽  
Author(s):  
Caner Erden ◽  
Halil Ibrahim Demir ◽  
Abdullah Hulusi Kökçam

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.


2017 ◽  
Vol 2 (1) ◽  
pp. 20-38 ◽  
Author(s):  
Halil Ibrahim Demir ◽  
◽  
Tarık Cakar ◽  
Mumtaz Ipek ◽  
Burak Erkayman ◽  
...  

Author(s):  
Halil Ibrahim Demir ◽  
Tarık Cakar ◽  
Mumtaz Ipek ◽  
Ozer Uygun ◽  
Murat Sari

Author(s):  
Li-Yan Wang ◽  
Xue Huang ◽  
Wei-Wei Liu ◽  
Yu-Bin Wu ◽  
Ji-Bo Wang

In this study, we consider single-machine scheduling problems with  past-sequence-dependent (denoted by psd) setup times in which the setup times of jobs are proportional to the length of already processed jobs. Under  common (CON) and slack (SLK) due-date assignment methods, we prove that the   weighted sum of earliness, tardiness and due-date minimization remains polynomially solvable.  We also give some extensions for the scheduling problems with  psd setup times.


Sign in / Sign up

Export Citation Format

Share Document