SOLVING PROCESS PLANNING, WEIGHTED APPARENT TARDINESS COST DISPATCHING, AND WEIGHTED PROCESSING PLUS WEIGHT DUE-DATE ASSIGNMENT SIMULTANEOUSLY USING A HYBRID SEARCH

Halil İbrahim DEMİR¹ , Caner ERDEN² , Mümtaz İPEK³ , Abdullah Hulisi KÖKÇAM⁴

Process planning, scheduling, and due date assignment play crucial role in manufacturing systems in terms of efficient and flexible production. Integration of the production functions has been studied in the literature. In this context, there are hundreds of works on integrated process planning and scheduling (IPPS) and scheduling with due date assignment (SWDDA) problems. In this paper, we extend the existing literature works on integrated process planning, scheduling and due date assignment (IPPSDDA) using a hybrid search algorithm. Since the scheduling problem is in the NP-Hard problem class without any integration, integrated problem is even harder to solve. This study focuses on the integration of these functions. Sum of weighted tardiness, earliness, and due date related costs are used as a penalty function. Random search and hybrid meta-heuristics are used to solve integrated problem. We used hybrid and random search techniques while solving the integrated problem. Full integration with hybrid search is found as the best combination. So, hybrid search outperformed random search and ordinary solutions were very poor compared to the search results.

Keywords
Process Planning and Scheduling, Scheduling with due date Assignment, Genetic Algorithms, Hybrid Search, Weighted Due-Date Assignment,