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 acquisting 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 35 (2007)
Issue (Month): 2 (April)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Swaminathan, Jayashankar M., 2000. "Tool capacity planning for semiconductor fabrication facilities under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 120(3), pages 545-558, February.
- Bashyam, T. C. A., 1996. "Competitive capacity expansion under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 95(1), pages 89-114, November.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:35:y:2007:i:2:p:237-246. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.