IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v18y1972i5-part-1p299-311.html
   My bibliography  Save this article

A Generalized Lagrange Multiplier Algorithm for Optimum or Near Optimum Production Scheduling

Author

Listed:
  • J. P. Evans

    (University of North Carolina)

  • F. J. Gould

    (University of North Carolina)

Abstract

In this paper we apply the concept of generalized Lagrange multipliers, introduced by Everett [Everett, H. 1963. Generalized lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. XI 399-417.], to the development of an algorithm for a one-period multi-product production model, where the objective is to maximize profit subject to constraints on aggregate regular time and overtime production. We assume no difference between the cost of idle time and regular time labor, so that the regular time cost is fixed. Overtime cost is variable. The price for each product is constant (independent of quantity sold), and everything produced can be sold. The optimum production schedule (maximum profit) will depend upon revenues, overtime costs, setup times, and productivities.

Suggested Citation

  • J. P. Evans & F. J. Gould, 1972. "A Generalized Lagrange Multiplier Algorithm for Optimum or Near Optimum Production Scheduling," Management Science, INFORMS, vol. 18(5-Part-1), pages 299-311, January.
    • Handle: RePEc:inm:ormnsc:v:18:y:1972:i:5-part-1:p:299-311
    DOI: 10.1287/mnsc.18.5.299
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.18.5.299
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.18.5.299?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:inm:ormnsc:v:18:y:1972:i:5-part-1:p:299-311. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.