A priority-based heuristic algorithm (PBHA) for optimizing integrated process planning and scheduling problem

Muhammad Farhan Ausaf,Ghiath Al Aqel,Liang Gao,Xinyu Li,Wenjun Xu

doi:10.1080/23311916.2015.1070494

Abstract

AbstractProcess planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS) problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing the IPPS problem, there is still room for improvement in terms of quality of solution and algorithm efficiency, especially for more complicated problems. Dispatching rules have been successfully utilized for solving complicated scheduling problems, but haven’t been considered extensively for the IPPS problem. This approach incorporates dispatching rules with the concept of prioritizing jobs, in an algorithm called priority-based heuristic algorithm (PBHA). PBHA tries to establish job and machine priority for sel...

Highlights

Process planning can be defined as the act of selection and sequencing of different processes and operations to transform a set of given raw materials into a finished component (Scallan, 2003)
An algorithm has been presented for the optimization of the integrated process planning and scheduling (IPPS) problem
The algorithm has been tested for a variety of benchmark problems and it can be concluded that the proposed algorithm is capable of producing improved results

Summary

Introduction

Process planning can be defined as the act of selection and sequencing of different processes and operations to transform a set of given raw materials into a finished component (Scallan, 2003). Scheduling, on the other hand, is related to the assignment of all the operations in every job to the available machines, ensuring that all the precedence constraints defined in the process plan are satisfied (Sugimura, Hino, & Mriwaki, 2001). The scheduling problem considered in this work is the flexible job-shop scheduling Problem (FJSP). FJSP is the extension of the classic job-shop scheduling problem (JSP). The main variation in FJSP is that unlike JSP an operation can have more than one feasible machine, making the problem more complicated

Methods

Findings

Discussion

Conclusion