IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v35y2007i2p237-246.html
   My bibliography  Save this article

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

Author

Listed:
  • Wang, S.M.
  • Chen, J.C.
  • Wang, K.-J.

Abstract

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.

Suggested Citation

  • Wang, S.M. & Chen, J.C. & Wang, K.-J., 2007. "Resource portfolio planning of make-to-stock products using a constraint programming-based genetic algorithm," Omega, Elsevier, vol. 35(2), pages 237-246, April.
  • Handle: RePEc:eee:jomega:v:35:y:2007:i:2:p:237-246
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(05)00086-1
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Bashyam, T. C. A., 1996. "Competitive capacity expansion under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 95(1), pages 89-114, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hsu, P.H. & Wee, H.M. & Teng, H.M., 2010. "Preservation technology investment for deteriorating inventory," International Journal of Production Economics, Elsevier, vol. 124(2), pages 388-394, April.
    2. Martínez-Costa, Carme & Mas-Machuca, Marta & Benedito, Ernest & Corominas, Albert, 2014. "A review of mathematical programming models for strategic capacity planning in manufacturing," International Journal of Production Economics, Elsevier, vol. 153(C), pages 66-85.
    3. Li, Gang & Jiang, Hongxun & He, Tian, 2015. "A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem," Omega, Elsevier, vol. 50(C), pages 1-17.
    4. Ramasesh, Ranga V., 2010. "Lot-sizing decisions under limited-time price incentives: A review," Omega, Elsevier, vol. 38(3-4), pages 118-135, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.