IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6315613.html
   My bibliography  Save this article

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

Author

Listed:
  • Xixing Li
  • Shunsheng Guo
  • Yi Liu
  • Baigang Du
  • Lei Wang

Abstract

The mode of production in the modern manufacturing enterprise mainly prefers to MTO (Make-to-Order); how to reasonably arrange the production plan has become a very common and urgent problem for enterprises’ managers to improve inner production reformation in the competitive market environment. In this paper, a mathematical model of production planning is proposed to maximize the profit with capacity constraint. Four kinds of cost factors (material cost, process cost, delay cost, and facility occupy cost) are considered in the proposed model. Different factors not only result in different profit but also result in different satisfaction degrees of customers. Particularly, the delay cost and facility occupy cost cannot reach the minimum at the same time; the two objectives are interactional. This paper presents a mathematical model based on the actual production process of a foundry flow shop. An improved genetic algorithm (IGA) is proposed to solve the biobjective problem of the model. Also, the gene encoding and decoding, the definition of fitness function, and genetic operators have been illustrated. In addition, the proposed algorithm is used to solve the production planning problem of a foundry flow shop in a casting enterprise. And comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm.

Suggested Citation

  • Xixing Li & Shunsheng Guo & Yi Liu & Baigang Du & Lei Wang, 2017. "A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-15, January.
  • Handle: RePEc:hin:jnlmpe:6315613
    DOI: 10.1155/2017/6315613
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/6315613.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/6315613.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/6315613?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6315613. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.