Parallel Line Assignment Problems
Two problems involving the assignment of men to jobs, in a production system with parallel lines, to maximize the steady state system production rate are studied. In the first, in which a man's production rate is independent of the line to which he is assigned, a simple rule "group the fastest men in the same line" is shown to be optimal. In the second, in which production rates are dependent on the production line, an algorithm is developed to obtain a solution.
Volume (Year): 19 (1972)
Issue (Month): 1 (September)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:19:y:1972:i:1:p:1-10. 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 references are entirely missing, you can add them using this form.