This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

ABSALOM: Balancing assembly lines with assignment restrictions

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Armin Scholl () (Chair of Decision Analysis and Management Science, Friedrich-Schiller-University Jena)
Malte Fliedner () (Institute of Industrial Management, University of Hamburg)
Nils Boysen () (Chair of Operations Management, Friedrich-Schiller-University Jena)

Additional information is available for the following registered author(s):

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 straightforward 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 (INFORMS J. Computing 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 is given the acronym ABSALOM. It consists of a favourable 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 though the additional assignment restrictions complicate the problem and require some components of SALOME to be modified in a relaxing manner.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.wiwi.uni-jena.de/Papers/wp-jbe200802.pdf
File Format: application/pdf
File Function:
Download Restriction: no

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

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 03 Mar 2008
Date of revision:
Handle: RePEc:jen:jenjbe:2008-02

Contact details of provider:
Web page: http://www.wiwi.uni-jena.de/

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.

For technical questions regarding this item, or to correct its listing, contact: ().

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 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.:
  1. 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. [Downloadable!] (restricted)
  2. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February. [Downloadable!] (restricted)
    Other versions:
  3. 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. [Downloadable!] (restricted)
  4. 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. [Downloadable!] (restricted)
    Other versions:
  5. 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. [Downloadable!] (restricted)
    Other versions:
  6. 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. [Downloadable!] (restricted)
  7. 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. [Downloadable!] (restricted)
  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. [Downloadable!] (restricted)
  9. 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. [Downloadable!] (restricted)
  10. 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. [Downloadable!]
Full references

Cited by:
(explanations, 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.)

  1. 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 06/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration. [Downloadable!]
  2. Armin Scholl & Nils Boysen, 2008. "The Multiproduct Parallel Assembly Lines Balancing Problem: Model and Optimization Procedure," Jena Research Papers in Business and Economics 13/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration. [Downloadable!]
Statistics
Access and download statistics

Did you know? The RePEc project started in 1997. Its precursor, NetEc, dates back to 1993.

This page was last updated on 2008-8-26.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.