IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Synchronous Unpaced Flow Lines with Worker Differences and Overtime Cost

Listed author(s):
  • Kenneth H. Doerr


    (University of Miami, School of Business Administration, Department of Management, Coral Gables, Florida 33124)

  • Theodore D. Klastorin


    (University of Washington School of Business, Department of Management Science, Box 353200, Seattle, Washington 98195-3200)

  • Michael J. Magazine


    (University of Cincinnati School of Business Administration, Department of Quantitative Analysis and Operations Management, Cincinnati, Ohio 45221)

Registered author(s):

    In this paper, we consider the design of a synchronous, unpaced flow line where workers operate at different skill levels and overtime is used, if necessary, to meet a daily production quota. The line is unpaced in the sense that items only move to the next workstation when all workers on the line have completed their respective tasks. The design problem in this case is to assign both workers and tasks to workstations to minimize the expected sum of regular and overtime costs. To solve this problem, we develop an optimization algorithm for smaller problems and a heuristic algorithm for larger problems, which we use to investigate the sensitivity of total expected cost to changes in the price of overtime, hiring practices, worker differences, and the overall amount of work time variability. Based on an extensive computational analysis, we found that (1) planned overtime is frequently beneficial, (2) more workers should be hired as worker variability increases, and (3) increases in overtime costs frequently yield a relatively lower percentage increase in total expected cost. Other managerial implications are discussed in the paper.

    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:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 46 (2000)
    Issue (Month): 3 (March)
    Pages: 421-435

    in new window

    Handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:421-435
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. F. Brian Talbot & James H. Patterson, 1984. "An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem," Management Science, INFORMS, vol. 30(1), pages 85-99, January.
    2. Anthony A. Mastor, 1970. "An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques," Management Science, INFORMS, vol. 16(11), pages 728-746, July.
    3. Fred N. Silverman & John C. Carter, 1986. "A Cost-Based Methodology for Stochastic Line Balancing with Intermittent Line Stoppages," Management Science, INFORMS, vol. 32(4), pages 455-463, April.
    4. Robert L. Carraway, 1989. "A Dynamic Programming Approach to Stochastic Assembly Line Balancing," Management Science, INFORMS, vol. 35(4), pages 459-471, April.
    5. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    6. Emmanuel Fernández-Gaucherand & Sanjay Jain & Hau L. Lee & Ambar G. Rao & M. R. Rao, 1995. "Improving Productivity by Periodic Performance Evaluation: A Bayesian Stochastic Model," Management Science, INFORMS, vol. 41(10), pages 1669-1678, October.
    Full references (including those not matched with items on IDEAS)

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

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:421-435. 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.