... the trajectories. Considering the two factors, we formulate this problem using integer programming. Each patch in the part can be considered as a group and the corner points as vertices. Assume there are n vertices ( v 1 , v 2 ,… v n ), which are partitioned into k groups g 1 , g 2 ,…, g k . Each group...

... and accordingly better part quality. We mathematically define the pixel blending problem and discuss its properties. Based on the formulation, we present several optimization models for solving the problem including a mixed-integer programming model, a linear programming model, and a two-stage optimization model...

... generations and models, and this paper presents such new methods. Mixed-integer programming models are developed for (1) designing manufacturing system configurations that are cost effective for product evolution involving uncertainty and (2) maximizing the recurrences of manufacturing tasks on the same...

... to control the number of system configurations considered by the DP. The first step in the heuristic is solving the simple Integer Program (IP-1) described in Sec. 4A for each production stage and period. The IP-DP heuristic is detailed in Sec. 4B . If the reconfiguration cost and prior system...

... selection problem has been formulated as an integer programming model. A heuristic algorithm was applied to select the best set of subassembly structures. This paper demonstrated that a data mining approach provides useful knowledge that could be applied to fairly price products as well impact future...

... a mathematical characterization that allows one to fully specify any instance of the CSI problem. 2 It has been shown that any instance of the CSI problem can be modeled as a directed graph and, subsequently, be formulated as an integer program using a time-expanded network representation and a time-indexed...