IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/vmt-3y1963i1p20-32.html
   My bibliography  Save this article

Even-Flow, A Scheduling Method for Reducing Lateness in Job Shops

Author

Listed:
  • Sanford S. Ackerman

    (Touche, Ross, Bailey & Smart,--80 Pine Street, New York 5, New York)

Abstract

The development of the Even-Flow system was initiated by Mr. Gregory M. Boni, who observed that the elapsed time to complete a job in job shops was often a function of the number of operations performed rather than the time spent actually performing the operations, and that the time between operations was relatively constant. When this is true, the job shop can be thought of as an assembly line in which the machines are the stations, and the work to be done at each station consists of all of the operations which must be performed if the jobs are to flow evenly from machine to machine through the shop. The existence of a predictable time between the successive operations of each job gives one the ability to schedule the completion of parts at desired due-dates with reasonable assurance. This ability is crucial in the production of parts for assembly lines; the shortage of one part could result in shut-down of the line or expensive out-of-station work. The Even-Flow system described below is an attempt to maximize the number of on-time completions by integrating the scheduling, loading, and dispatching functions in a manner which capitalizes on the "natural" movement of work through the shop. The simulation of this system in comparison with other scheduling rules, described below, was conducted by Professors Conway and Maxwell on the Cornell University Simulator, a program written for the IBM-650. "Management Technology", ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.

Suggested Citation

  • Sanford S. Ackerman, 1963. "Even-Flow, A Scheduling Method for Reducing Lateness in Job Shops," Management Science, INFORMS, vol. 0(1), pages 20-32, May.
  • Handle: RePEc:inm:ormnsc:v:mt-3:y:1963:i:1:p:20-32
    DOI: 10.1287/mantech.3.1.20
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mantech.3.1.20
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mantech.3.1.20?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:mt-3:y:1963:i:1:p:20-32. 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.