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

Labor Assignment as a Dynamic Control Problem

Author

Listed:
  • Rosser T. Nelson

    (University of California, Los Angeles, California)

Abstract

A problem of labor assignment in a labor and machine limited production system is formulated as a dynamic control problem. The criterion function employed is total in-process inventory cost over a time period [O, T]. The Pontryagin maximum principle is applied to obtain necessary and sufficient conditions for the optimal control. Specifications defining the admissible set of control vectors leads directly to the constrained optimal solution that is found to be a time-dependent control determined by both the queue lengths and transitions among production centers. Some examples are given to illustrate the nature of the resulting priority policies in tandem and network type systems. A number of limiting assumptions and omissions that facilitated analytical resolution of the problem are discussed to suggest challenging possibilities for extensions of the model.

Suggested Citation

  • Rosser T. Nelson, 1966. "Labor Assignment as a Dynamic Control Problem," Operations Research, INFORMS, vol. 14(3), pages 369-376, June.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:369-376
    DOI: 10.1287/opre.14.3.369
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.3.369
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.3.369?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
    ---><---

    Citations

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


    Cited by:

    1. Gabriel Zayas-Cabán & Jingui Xie & Linda V. Green & Mark E. Lewis, 2016. "Dynamic control of a tandem system with abandonments," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 279-293, December.

    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:14:y:1966:i:3:p:369-376. 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.