Article ID: | iaor19931733 |
Country: | United Kingdom |
Volume: | 31 |
Issue: | 2 |
Start Page Number: | 311 |
End Page Number: | 324 |
Publication Date: | Feb 1993 |
Journal: | International Journal of Production Research |
Authors: | Wang Hsu-Pin, Lin Cheng-Jung |
Keywords: | programming: integer, programming: dynamic, scheduling |
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, the authors 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, the authors 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.