Ant colony optimization for the single model U-type assembly line balancing problem
An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject to precedence constraints with the objective of optimizing a performance measure. In this paper, we propose ant colony algorithms to solve the single-model U-type assembly line balancing problem. We conduct an extensive experimental study in which the performance of the proposed algorithm is compared against best known algorithms reported in the literature. The results indicate that the proposed algorithms display very competitive performance against them.
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.
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.
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.:
- G. J. Miltenburg & J. Wijngaard, 1994. "The U-line Line Balancing Problem," Management Science, INFORMS, vol. 40(10), pages 1378-1388, October.
- 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.
- Urban, Timothy L. & Chiang, Wen-Chyuan, 2006. "An optimal piecewise-linear program for the U-line balancing problem with stochastic task times," European Journal of Operational Research, Elsevier, vol. 168(3), pages 771-782, February.
- Lin, B.M.T. & Lu, C.Y. & Shyu, S.J. & Tsai, C.Y., 2008. "Development of new features of ant colony optimization for flowshop scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 742-755, April.
- Chiang, Wen-Chyuan & Urban, Timothy L., 2006. "The stochastic U-line balancing problem: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1767-1781, December.
- Bautista, Joaquin & Pereira, Jordi, 2007. "Ant algorithms for a time and space constrained assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2016-2032, March.
- Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
- Scholl, Armin, 1995. "Data of assembly line balancing problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 25075, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Hertz, Alain & Widmer, Marino, 2003. "Guidelines for the use of meta-heuristics in combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 151(2), pages 247-252, December.
- Timothy L. Urban, 1998. "Note. Optimal Balancing of U-Shaped Assembly Lines," Management Science, INFORMS, vol. 44(5), pages 738-741, May.
- 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.
- Nakade, Koichi & Ohno, Katsuhisa, 2003. "Separate and carousel type allocations of workers in a U-shaped production line," European Journal of Operational Research, Elsevier, vol. 145(2), pages 403-424, March.
- Nakade, Koichi & Ohno, Katsuhisa, 1999. "An optimal worker allocation problem for a U-shaped production line," International Journal of Production Economics, Elsevier, vol. 60(1), pages 353-358, April.
- Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, January.
- T'kindt, Vincent & Monmarche, Nicolas & Tercinet, Fabrice & Laugt, Daniel, 2002. "An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 250-257, October.
- 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.
- F. Brian Talbot & James H. Patterson & William V. Gehrlein, 1986. "A Comparative Evaluation of Heuristic Line Balancing Techniques," Management Science, INFORMS, vol. 32(4), pages 430-454, April.
When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:120:y:2009:i:2:p:287-300. 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: (Shamier, Wendy)
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.