An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
AbstractIn this paper, we describe an integer programming algorithm for assigning tasks on an assembly line to work stations in such a way that the number of work stations is minimal for the rate of production desired. The procedure insures that no task is assigned to a work station before all tasks which technologically must be performed before it have been assigned (precedence restrictions are not violated), and that the total time required at each work station performing the tasks assigned to it does not exceed the time available (cycle time restrictions are not violated). The procedure is based on a systematic evaluation (enumeration) of all possible task assignments to work stations. Significant portions of the enumeration process are performed implicitly, however, by utilizing tests described in the paper which are based on the specific structure of the line balancing problem. An artifice termed a network cut is also developed which eliminates from explicit consideration the assignment of tasks to work stations where such assignments would not lead to improved line balances. Results reported demonstrate that the procedure can obtain optimal balances for assembly lines with between 50 and 100 tasks in a reasonable amount of computation time and with modest computer storage requirements.
Download InfoIf 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.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 30 (1984)
Issue (Month): 1 (January)
production/scheduling: line balancing; programming: integer algorithms; enumerative; networks/graphs;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Armin Scholl & Christian Becker, 2003.
"State-of-the-art exact and heuristic solution procedures for simple assembly line balancing,"
Jenaer Schriften zur Wirtschaftswissenschaft
20/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
- Chen, Ruey-Shun & Lu, Kun-Yung & Tai, Pei-Hao, 2004. "Optimizing assembly planning through a three-stage integrated approach," International Journal of Production Economics, Elsevier, vol. 88(3), pages 243-256, April.
- Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
- Miltenburg, John, 1998. "Balancing U-lines in a multiple U-line facility," European Journal of Operational Research, Elsevier, vol. 109(1), pages 1-23, August.
- Pinnoi, Anulark & Wilhelm, Wilbert E., 2000. "Valid inequalities for a class of assembly system problems," European Journal of Operational Research, Elsevier, vol. 126(1), pages 31-50, October.
- Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
- Sawik, Tadeusz, 1998. "A lexicographic approach to bi-objective loading of a flexible assembly system," European Journal of Operational Research, Elsevier, vol. 107(3), pages 656-668, June.
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.