A linearized polynomial mixed integer programming model for the integration of process planning and scheduling |
| |
Authors: | Wei Tan Behrokh Khoshnevis |
| |
Affiliation: | (1) Paraster, Inc., 8121 Hyannisport Drive, Cupertino, CA 95014, USA;(2) Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089-0193, USA |
| |
Abstract: | This paper presents a linearized polynomial mixed-integer programming model (PMIPM) for the integration of process planning and scheduling problem. First, the integration problem is modeled as a PMIPM in which some of the terms are of products of up to three variables, of both binary and continuous in nature. Then, an equivalent linearized model is derived from the polynomial model by applying certain linearization techniques. Although the linearized models have more variables and constraints than their polynomial counterparts, they are potentially solvable to the optimum in comparison to their equivalent polynomial models. Experiments show that the linearized model possesses certain characteristics that are absent from other models in the literature, and provides a fundamental framework for further research in this area. |
| |
Keywords: | Process planning scheduling integration mixed integer programming planning window |
本文献已被 SpringerLink 等数据库收录! |
|