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

Multi-product scheduling on a single machine: A case study

Author

Listed:
  • Mallya, R

Abstract

The multi-product single machine scheduling problem is not new in the literature. The usual method of solution offered consists of determining the Economic Batch Quantities (EBQ) and then finding an acceptable way of scheduling these quantities on the single facility. However, past experience shows that EBQs cannot be scheduled in the same solution because of some limitations, mostly when a product produced earlier has run out of stock. Eventually, an acceptable batch quantity has to be selected that will satisfy a set of given conditions or objectives. Before calculating the EBQ, it is generally necessary to determine the main cost factors, namely, the set up cost of the machine and the inventory holding cost of the product. A case study is described in this paper, in which the scheduling was carried out without the determination of these costs. However, deviations from this solution may have to be considered. A simple way of calculating the costs incurred by such deviations is described.

Suggested Citation

  • Mallya, R, 1992. "Multi-product scheduling on a single machine: A case study," Omega, Elsevier, vol. 20(4), pages 529-534, July.
    • Handle: RePEc:eee:jomega:v:20:y:1992:i:4:p:529-534
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(92)90027-5
    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.

    Citations

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


    Cited by:

    1. Mohammadi, Maryam & Musa, Siti Nurmaya & Bahreininejad, Ardeshir, 2015. "Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 404-422.
    2. Grznar, J. & Riggle, C., 1997. "An optimal algorithm for the basic period approach to the economic lot scheduling problem," Omega, Elsevier, vol. 25(3), pages 355-364, 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:20:y:1992:i:4:p:529-534. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.