Optimal operation planning and sequencing: minimization of tool changeovers

Abstract

Process planning is divided into two major tasks: routeing planning and operation planning. For operation planning a two-phase problem solving structure is proposed. In phase I, we focus on selection of process plans for a group of parts to be machined for the next planning cycle. It is formulated and solved as a dynamic programming problem. In phase II, we select and sequence operations and tools for those process plans. To this end, two 0–1 integer programming models are formulated and solved. A numerical example is presented to illustrate the problem solving steps.