Hostname: page-component-77c89778f8-7drxs Total loading time: 0 Render date: 2024-07-17T01:01:10.986Z Has data issue: false hasContentIssue false
  • English
  • Français

Metaheuristics based on Bin Packing for the line balancing problem

Published online by Cambridge University Press:  15 June 2007

Michel Gourgand ,
Nathalie Grangeon  and
Sylvie Norre
Michel Gourgand
Affiliation:
Université Blaise Pascal, LIMOS CNRS UMR 6158, ISIMA, BP 10125, 63173 Aubière Cedex, France; grangeon@isima.fr; gourgand@isima.fr
Nathalie Grangeon
Affiliation:
Université Blaise Pascal, LIMOS CNRS UMR 6158, Antenne IUT de Montluçon, Avenue Aristide Briand, 03100 Montluçon, France; norre@moniut.univ-bpclermont.fr
Sylvie Norre
Affiliation:
Université Blaise Pascal, LIMOS CNRS UMR 6158, Antenne IUT de Montluçon, Avenue Aristide Briand, 03100 Montluçon, France; norre@moniut.univ-bpclermont.fr
Get access

Abstract

The line balancing problem consits in assigning tasks to stations in order to respect precedence constraints and cycle time constraints. In this paper, the cycle time is fixed and the objective is to minimize the number of stations. We propose to use metaheuristics based on simulated annealing by exploiting the link between the line balancing problem and the bin packing problem. The principle of the method lies in the combination between a metaheuristic and a bin packing heuristic. Two representations of a solution and two neighboring systems are proposed and the methods are compared with results from the literature. They are better or similar to tabu search based algorithm.


Keywords

Flow-shopstochasticMarkovian analysissimulationmetaheuristic
Type
Research Article
Information
RAIRO - Operations Research , Volume 41 , Issue 2: ROADEF 05 , April 2007 , pp. 193 - 211
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Anderson, E.J. and Ferris, M.C., Genetic algorithms for combinatorial optimization: The assembly line balancing problem. ORSA J. Comput. 6 (1994) 161–174. CrossRef
Amen, M., Heuristic method for cost-oriented assembly line balancing: A survey. Inter. J. Prod. Econ. 68 (2000) 1–14. CrossRef
Arcus, A.L., Comsoal a computer method of sequencing operations for assembly lines. Inter. J. Prod. Res. 4 (1966) 259–277.
Baybars, I., A survey of exact algorithms for the simple assembly line balancing problem. Manage. Sci. 32 (1986) 909–932. CrossRef
C. Boutevin, L. Deroussi, M. Gourgand and S. Norre, Supply chain Optimisation, chapter Hybrid methods for line balancing problems, edited by A. Dolgui, J. Soldek, O. Zaikin, Kluwer Academic Publishers (2004).
C. Boutevin, Problème d'Ordonnancement et d'Affectation avec Contraintes de Ressources de type RCPSP et Line Balancing. Ph.D. thesis, Université Blaise Pascal, Clermont-Ferrand (2003).
J. Bautista and J. Pereira, Ant algorithms for assembly line balancing. In Berlin Springer, editor, Ant algorithms, Third International Workshop, ANTS 2002 Proceedings, Bruxelles (Belgique), edited by M. Dorigo, G. Di Caro, M. Sampels Lect. Notes Comput. Sci. 2463 (2002) 65–75.
T.K. Bhattacharjee and S. Sahu, A critique of some current assembly line balancing techni. Technical report, Indian Institute of Technology, Kharagpur, India (1987).
Chiang, W.C., The application of a tabu search metaheuristic to the assembly line balancing problem. Ann. Oper. Res. 77 (1998) 209–227. CrossRef
E.G. Coffman Jr., M.R. Garey and D.S. Johnson, Approximation algorithms for bin packing: A survey, in Approximation Algorithms for NP-Hard Problems, edited by Dorit S. Hochbaum (1997) 46–93.
Corcoran, A.L. and Wainwright, R.L., Using libga to develop genetic algorithms for solving combinatorial optimization problems. Appl. Handbook Genetic Algorithms 1 (1995) 144–172.
L. Deroussi, Heuristiques, métaheuristiques et systèmes de voisinage. Ph.D. thesis, Université Blaise Pascal, Clermont-Ferrand II (2002).
E. Falkenauer and A. Delchambre, A genetic algorithm for bin packing and line balancing, in Proceedings of IEEE International Conference on Robotics and Automation (ICRA92), Los Alamitos, Californie (1992) 1186–1192.
G. Fleury, Méthodes stochastiques et déterministes pour les problèmes NP-difficiles. Ph.D. thesis, Université Blaise Pascal, Clermont-Ferrand II (1993).
Helgeson, W.B. and Birnie, D.P., Assembly line balancing using the rank positional weight technique. J. Ind. Eng. 12 (1961) 394–398.
A. Heinrici, A comparison between simulated annealing and tabu search with an example for the production planning, in Operations Research Proceedings, Amsterdam, 1993, edited by Dyckhoff et al. Springer, Berlin (1994) 498–503.
S.D. Lapierre, A. Ruiz and P. Soriano, Balancing assembly lines with tabu search. Eur. J. Oper. Res. (2004) in press.
McMullen, P.R. and Frazier, G.V., Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations. Inter. J. Prod. Res. 36 (1998) 2717–2741. CrossRef
Minzu, V. and Henrioud, J.M., Stochastic algorithm for task assignment in single or mixed-model assembly lines. APII-JESA 32 (1998) 831–851.
McMullen, P.R. and Tarasewich, P., Using ant techniques to solve the assembly line balancing problem. IEE Transactions 35 (2003) 605–617. CrossRef
B. Rekiek, Assembly Line Design: Multiple Objective Grouping Genetic Algorithm and the Balancing of Mixed-model Hybrid Assembly Line. Ph.D. thesis, Université Libre de Bruxelles (2000).
Rubinovitz, J. and Levitin, G., Genetic algorithm for assembly line balancing. Inter. J. Prod. Econ. 41 (1995) 444–454.
A. Scholl and C. Becker, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, special issue on Balancing of Automated Assembly and Transfer Lines, edited by A. Dolgui 168 (2006) 666–693.
A. Scholl, Balancing and Sequencing of Assembly Lines. Physica-Verlag Heidelberg, New-York (1999).
Scholl, A. and Klein, R., Balancing assembly lines effectively – a computational comparison. Eur. J. Oper. Res. 114 (1999) 50–58. CrossRef
Suresh, G. and Sahu, S., Stochastic assembly line balancing using simulated annealing. J. Production Res. 32 (1994) 1801–1810. CrossRef
Scholl, A. and Voss, S., Simple assembly line balancing – heuristic approaches. J. Heuristics 2 (1996) 217–244. CrossRef
Talbot, F.B. and Patterson, J.H., An integer programming algorithms with network cuts for solving the single model assembly line balancing problem. Manage. Sci. 32 (1984) 85–99. CrossRef
Wee, T.S. and Magazine, M.J., Assembly line as generalized bin packing. Oper. Res. Lett. 1 (1982) 56–58. CrossRef