A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities
AbstractThis paper describes a branch and bound algorithm which can solve assembly line balancing probems with nine modifications to the originally formulated problem of minimizing the required number of assembly stations, given a cycle time, a set of tasks with given deterministic performance times, and between-task precedence relationships. The first two formulation modifications are those of permitting planned imbalance in the total of task performance times at each assembly station, and allowing specific tasks to be assigned to specific types of assembly stations. Seven further problem modifications can be solved by the proposed algorithm, or by any algorithm or heuristic that can solve problems containing these first two modifications. They are: treatment of stochastic task performance times on unpaced lines; requirement of particular tasks to be assigned to particular stations; requirement of task groupings according to task skill levels; requirement of particular tasks to be assigned to only a left-of-line or right-of line station; required task separations; some mixed model situations; and where paralleling of a specified task into two (or more stations) is permitted. The algorithm is presented in both conceptual and detailed form. Computer computation times to solve a selected cross-sectional sample of problems are provided.
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): 29 (1983)
Issue (Month): 11 (November)
production/scheduling: line balancing; facilities/equipment planning: design; networks/graphs: applications;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Fatih Ugurdag, H. & Rachamadugu, Ram & Papachristou, Christos A., 1997. "Designing paced assembly lines with fixed number of stations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 488-501, November.
- Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008.
"Assembly line balancing: Which model to use when,"
International Journal of Production Economics,
Elsevier, vol. 111(2), pages 509-528, February.
- van Zante-de Fokkert, Jannet I. & de Kok, Ton G., 1997. "The mixed and multi model line balancing problem: a comparison," European Journal of Operational Research, Elsevier, vol. 100(3), pages 399-412, August.
- Armin Scholl & Malte Fliedner & Nils Boysen, 2008.
"Absalom: Balancing assembly lines with assignment restrictions,"
Jena Research Papers in Business and Economics - Working and Discussion Papers
02/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.
- Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
- Christian Becker & Armin Scholl, 2008. "Balancing assembly lines with variable parallel workplaces: Problem definition, model and exact solution procedure," Jena Research Papers in Business and Economics - Working and Discussion Papers 06/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- 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.
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.