Resource portfolio planning of make-to-stock products using a constraint programming-based genetic algorithm

The investment on facilities for manufacturing high-tech products requires a large amount of capital. Even though the demands of such products change dramatically, a company is forced to implement some make-to-stock policies apart from a regular make-to-order production, so that the capacity of expensive resources can be highly utilized. The inherent characteristics to be considered include finite budget for investing resources, lump demands of customers, long production horizon, many types of products to mix simultaneously, time value of capital and asset, technology innovation of resources, efficient usage of multiple-function machines, and limited capacity of resources. In addition to revenue gained from products and the salvage/assets of resources, a decision maker also needs to consider costs regarding inventory, backorder, and resource acquisition-related costs through procurement, renting, and transfer. This study thus focuses on the following issues: (i) how to decide on resources portfolio regarding the way and timing of acquiring resources, and (ii) how to allocate resources to various orders in each production period. The goal is to maximize the long-term profit. This study formulates the problem as a non-linear mixed integer mathematical programming model. A constraint programming-based genetic algorithm is developed. It has been demonstrated to solve the problem efficiently.