IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v6y1958i6p835-848.html
   My bibliography  Save this article

A Dynamic-Programming Computational Procedure for Optimal Manpower Loading in a Large Aircraft Company

Author

Listed:
  • Albert B. Bishop

    (Department of Industrial Engineering and Operations Research Group, The Ohio State University, Columbus, Ohio)

  • Thomas H. Rockwell

    (Department of Industrial Engineering and Operations Research Group, The Ohio State University, Columbus, Ohio)

Abstract

A dynamic-programming model is developed for the determination of optimal manpower schedules in a large aircraft plant. The basic model consists of a cost equation representing the weekly costs of obtaining, utilizing, and disposing of various categories of personnel. Losses in efficiency in weeks following transfers among jobs or hiring of new men are included. The optimum schedule is that which minimizes the sum of the weekly costs over an arbitrary scheduling period for a given forecast demand. Computation of the minimum-cost schedule is accomplished by use of dynamic programming. This formulation of the problem ( a ) leads directly to the optimum solution, ( b ) is independent of the functional form of the cost equation, ( c ) can utilize tabular data directly without the necessity of curve-fitting, ( d ) permits ready adjustment for changes in process parameters and demand forecasts, and ( e ) is readily programmed for computer solution, but, if need be, it can be earned out manually with some simple computational aids. The procedure is illustrated for a hypothetical demand curve and a representative cost equation.

Suggested Citation

  • Albert B. Bishop & Thomas H. Rockwell, 1958. "A Dynamic-Programming Computational Procedure for Optimal Manpower Loading in a Large Aircraft Company," Operations Research, INFORMS, vol. 6(6), pages 835-848, December.
    • Handle: RePEc:inm:oropre:v:6:y:1958:i:6:p:835-848
    DOI: 10.1287/opre.6.6.835
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.6.6.835
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.6.6.835?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:oropre:v:6:y:1958:i:6:p:835-848. 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.