Advanced Search
MyIDEAS: Login

Absalom: Balancing assembly lines with assignment restrictions

Contents:

Author Info

  • Armin Scholl

    ()
    (School of Economics and Business Administration, Friedrich-Schiller-University Jena)

  • Malte Fliedner
  • Nils Boysen

    ()
    (School of Economics and Business Administration, Friedrich-Schiller-University Jena)

Abstract

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On the other hand, a number of real-world extensions of SALBP have been introduced but solved with straight-forward and simple heuristics in many cases. Therefore, there is a lack of procedures for exactly solving such generalized ALBP.In this paper, we show how to extend the well-known solution procedure Salome [Scholl, A., Klein, R., 1997. Salome: A bidirectional branch-and-bound procedure for assembly line balancing. Informs J. Comput. 9 319-334], which is able to solve even large SALBP instances in a very effective manner, to a problem extension with different types of assignment restrictions (called ARALBP). The extended procedure, referred to as Absalom, employs a favorable branching scheme, an arsenal of bounding rules and a variety of logical tests using ideas from constraint programming.Computational experiments show that Absalom is a very promising exact solution approach although the additional assignment restrictions complicate the problem considerably and necessitate a relaxation of some components of Salome.

Download Info

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: http://dx.doi.org/10.1016/j.ejor.2009.01.049
Our checks indicate that this address may not be valid because: 503 Service Unavailable (http://dx.doi.org/10.1016/j.ejor.2009.01.049 [303 See Other]--> http://linkinghub.elsevier.com/retrieve/pii/S0377221709000575 [301 Moved Permanently]--> http://linkinghub.elsevier.com/retrieve/articleSelectSinglePerm?Redirect=http://www.sciencedirect.com/science/article/pii/S0377221709000575?via%3Dihub [301 Moved Permanently]--> http://www.sciencedirect.com/science/article/pii/S0377221709000575?via=ihub). If this is indeed the case, please notify ()
Download Restriction: no

Bibliographic Info

Paper provided by Friedrich-Schiller-University Jena, School of Economics and Business Administration in its series Jena Research Papers in Business and Economics - Working and Discussion Papers with number 02/2008.

as in new window
Length:
Date of creation: 2008
Date of revision:
Publication status: Published in: European Journal of Operational Research 200/3 (2010), 688-701.
Handle: RePEc:jen:jenjbe:2008-02

Contact details of provider:
Postal: Carl-Zeiss-Strasse 3, 07743 JENA
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.wiwi.uni-jena.de/
More information through EDIRC

Order Information:
Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.

Related research

Keywords: Assembly line balancing; Assignment restrictions; Combinatorial optimization; Branch-and-bound;

Other versions of this item:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. G. M. Buxey, 1974. "Assembly Line Balancing with Multiple Stations," Management Science, INFORMS, vol. 20(6), pages 1010-1021, February.
  2. 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.
  3. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2007. "A classification of assembly line balancing problems," European Journal of Operational Research, Elsevier, vol. 183(2), pages 674-693, December.
  4. Roger V. Johnson, 1983. "A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities," Management Science, INFORMS, vol. 29(11), pages 1309-1324, November.
  5. Scholl, Armin & Klein, Robert, 1997. "SALOME. a bidirectional branch and bound procedure for assembly line balancing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7890, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  6. \.Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
  7. 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.
  8. Berger, Ilana & Bourjolly, Jean-Marie & Laporte, Gilbert, 1992. "Branch-and-bound algorithms for the multi-product assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 215-222, April.
  9. Sawik, Tadeusz, 2002. "Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line," European Journal of Operational Research, Elsevier, vol. 143(1), pages 115-124, November.
  10. Armin Scholl & Christian Becker, 2003. "A survey on problems and methods in generalized assembly line balancing," Jenaer Schriften zur Wirtschaftswissenschaft 21/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
  11. Armin Scholl & Nils Boysen & Malte Fliedner, 2006. "The sequence-dependent assembly line balancing problem," Jenaer Schriften zur Wirtschaftswissenschaft 18/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
  12. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
  13. Lapierre, Sophie D. & Ruiz, Angel & Soriano, Patrick, 2006. "Balancing assembly lines with tabu search," European Journal of Operational Research, Elsevier, vol. 168(3), pages 826-837, February.
  14. 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.
  15. Scholl, Armin, 1999. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10881, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  16. Saltzman, Matthew J. & Baybars, Ilker, 1987. "A two-process implicit enumeration algorithm for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 32(1), pages 118-129, October.
  17. Gokcen, Hadi & Erel, Erdal, 1997. "A goal programming approach to mixed-model assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 48(2), pages 177-185, January.
  18. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Scholl, Armin & Boysen, Nils, 2009. "Designing parallel assembly lines with split workplaces: Model and optimization procedure," International Journal of Production Economics, Elsevier, vol. 119(1), pages 90-100, May.
  2. 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.
  3. Alena Otto & Armin Scholl, 2010. "Incorporating ergonomic risks into assembly line balancing," Jena Research Papers in Business and Economics - Working and Discussion Papers 11/2010, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  4. Hanne Klindworth & Christian Otto & Armin Scholl, 2010. "On a learning precedence graph concept for the automotive industry," Jena Research Papers in Business and Economics - Working and Discussion Papers 09/2010, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  5. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
  6. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
  7. Armin Scholl & Nils Boysen, 2008. "The Multiproduct Parallel Assembly Lines Balancing Problem: Model and Optimization Procedure," Jena Research Papers in Business and Economics - Working and Discussion Papers 13/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  8. Otto, Alena & Otto, Christian & Scholl, Armin, 2013. "Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 228(1), pages 33-45.

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:jen:jenjbe:2008-02. 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: ().

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.