Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Dynamic Model for the Optimal Loading of Linear Multi-Operation Shops

Contents:

Author Info

  • Salah E. Elmaghraby

    (Department of Industrial Administration, Yale University and The RAND Corporation)

  • Allen S. Ginsberg

    (Department of Industrial Administration, Yale University and The RAND Corporation)

Registered author(s):

    Abstract

    Because of the stochastic nature of the parameters in the general job shop problem (e.g., estimates of processing times; estimates of delay times; the sequence of operations; the availability of processing units; etc.), Monte Carlo simulation has been the principal tool of analysis. In particular, a large proportion of studies was focused on the indirect control of the functions of scheduling and loading by the device of assigning priorities to the various jobs in the shop. In this paper, we depart from this tradition for two good reasons. First, the linear characteristic of flow eliminates an important disrupting factor present in the general problem treated by the other authors. Second, priority decision rules are perhaps the last sphere of decision open to managers and may have a very limited effect since they are seriously constrained by previously-made decisions. In fact, priority decisions, coming as they do at the "tail" of the decision process, may prove ineffectual in the face of previously-established sales quantities, promised due dates, capacity limitations, etc. Consequently, a study of the "higher echelon" decisions of scheduling and loading is necessitated. "Management Technology", ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mantech.4.1.47
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Technology.

    Volume (Year): MT-4 (1964)
    Issue (Month): 1 (June)
    Pages: 47-58

    as in new window
    Handle: RePEc:inm:ormnsc:v:mt-4:y:1964:i:1:p:47-58

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:mt-4:y:1964:i:1:p:47-58. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.