Advanced Search
MyIDEAS: Login to save this article or follow this journal

Designing parallel assembly lines with split workplaces: Model and optimization procedure

Contents:

Author Info

  • Scholl, Armin
  • Boysen, Nils

Abstract

A production system which consists of a number of parallel assembly lines is considered. On each line a certain product is manufactured observing a common cycle time. By arranging the lines in a favourable manner, it is possible to increase efficiency of the production system by combining stations of neighbouring lines when balancing them. The objective is to minimize the number of workplaces (operators) required. This problem is called parallel assembly line balancing problem (PALBP) and has previously been considered by Gökçen et al. [2006. Balancing of parallel assembly lines. Int. J. Prod. Econ. 103, 600-609]. In the paper on hand, we give a detailed problem description and model the problem as a binary linear programme. Furthermore, an exact solution approach based on an extension of the well-known branch-and-bound procedure Salome is proposed. Computational experiments show that this procedure clearly outperforms other approaches as it is able to solve small- to medium-sized problem instances to optimality and provides good heuristic solutions for large-sized problems.

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://www.sciencedirect.com/science/article/B6VF8-4VKP3WH-1/2/2cc8eced0e714ac0e9b07813922c007e
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal International Journal of Production Economics.

Volume (Year): 119 (2009)
Issue (Month): 1 (May)
Pages: 90-100

as in new window
Handle: RePEc:eee:proeco:v:119:y:2009:i:1:p:90-100

Contact details of provider:
Web page: http://www.elsevier.com/locate/ijpe

Related research

Keywords: Assembly line balancing Parallel assembly lines Combinatorial optimization Branch-and-bound;

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. 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.
  2. Scholl, Armin, 1995. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  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. 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).
  5. 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.
  6. 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.
  7. G. J. Miltenburg & J. Wijngaard, 1994. "The U-line Line Balancing Problem," Management Science, INFORMS, vol. 40(10), pages 1378-1388, October.
  8. Klein, Robert, 2000. "Scheduling of resource constrained projects," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 1592, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  9. 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.
  10. 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.
  11. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
  12. 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.
  13. Armin Scholl & Nils Boysen & Malte Fliedner, 2008. "Optimally solving the Alternative Subgraphs Assembly Line Balancing Problem," Jena Research Papers in Business and Economics - Working and Discussion Papers 05/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  14. Gokcen, Hadi & Agpak, Kursad & Benzer, Recep, 2006. "Balancing of parallel assembly lines," International Journal of Production Economics, Elsevier, vol. 103(2), pages 600-609, October.
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. 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.
  2. Araújo, Felipe F.B. & Costa, Alysson M. & Miralles, Cristóbal, 2012. "Two extensions for the ALWABP: Parallel stations and collaborative approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 483-495.
  3. 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.

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:eee:proeco:v:119:y:2009:i:1:p:90-100. 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: (Zhang, Lei).

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.