IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i2d10.1057_palgrave.jors.2600683.html
   My bibliography  Save this article

A heuristic algorithm for a production planning problem in an assembly system

Author

Listed:
  • M-W Park

    (Chonbuk National University)

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology)

Abstract

This paper focuses on a production planning problem in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problem, that is, tardiness is not allowed. The objective of the problem is to minimise holding costs for final product inventory as well as work-in-process inventory. A non-linear mathematical model is presented and a heuristic algorithm is developed using a solution property and a network model for defining solutions of the problem. A series of computational tests were done to compare the algorithm with a commercial planning/scheduling software and backward finite-loading methods that employ various priority rules. The results showed that the suggested algorithm outperformed the others.

Suggested Citation

  • M-W Park & Y-D Kim, 1999. "A heuristic algorithm for a production planning problem in an assembly system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 138-147, February.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:2:d:10.1057_palgrave.jors.2600683
    DOI: 10.1057/palgrave.jors.2600683
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600683
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600683?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
    ---><---

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

    Citations

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


    Cited by:

    1. Sarker, Bhaba R. & Diponegoro, Ahmad, 2009. "Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers," European Journal of Operational Research, Elsevier, vol. 194(3), pages 753-773, May.
    2. Rahman, Mohammad Anwar Ashek & Sarker, Bhaba R., 2007. "Supply chain models for an assembly system with preprocessing of raw materials," European Journal of Operational Research, Elsevier, vol. 181(2), pages 733-752, September.

    More about this item

    Keywords

    production planning; heuristics;

    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:pal:jorsoc:v:50:y:1999:i:2:d:10.1057_palgrave.jors.2600683. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.