Abstract
Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimisation of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The aim of this contribution is to present a new algorithm, based on the GRASP methodology, for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations, given a fixed cycle time limit. The good behaviour of our proposal is demonstrated by means of performance indicators in four problem instances and a real one from a Nissan factory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Scholl, A.: Balancing and Sequencing of Assembly Lines, 2nd edn. Physica-Verlag, Heidelberg (1999)
Bautista, J., Pereira, J.: Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research 177, 2016–2032 (2007)
Glover, F., Kochenberger, G.A. (eds.): Handbook of Metaheuristics. Kluwer Academic, Dordrecht (2003)
Chica, M., Cordón, O., Damas, S., Bautista, J.: Multi-objective, constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and randomised greedy. Technical Report AFE-09-01, European Centre for Soft Computing, Asturias, Spain (2009) (submitted to Information Sciences)
Chica, M., Cordón, O., Damas, S., Bautista, J.: Adding diversity to a multiobjective ant colony algorithm for time and space assembly line balancing. In: 2009 IEEE International Symposium on Assembly and Manufacturing (ISAM 2009), Suwon, Korea, pp. 364–379 (2009)
Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: 21st IASTED Conference, Innsbruck, Germany, pp. 97–102 (2003)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research 168(3), 666–693 (2006)
Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. Journal of Heuristics 10, 59–88 (2004)
Teghem, J., Jaszkiewicz, A.: Multiple objective metaheuristics for combinatorial optimization: A tutorial. In: 4th Metaheuristic International Conference (MIC 2003), Kyoto, Japan, pp. 25–28 (2003)
Rachamadugu, R., Talbot, B.: Improving the equality of workload assignments in assembly lines. International Journal of Production Research 29, 619–633 (1991)
Jaszkiewicz, A.: Genetic local search for multiple objective combinatorial optimization. European Journal of Operational Research 137(1), 50–71 (2002)
Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-objective Problems, 2nd edn. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chica, M., Cordón, O., Damas, S., Bautista, J. (2010). A Multiobjective GRASP for the 1/3 Variant of the Time and Space Assembly Line Balancing Problem. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13033-5_67
Download citation
DOI: https://doi.org/10.1007/978-3-642-13033-5_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13032-8
Online ISBN: 978-3-642-13033-5
eBook Packages: Computer ScienceComputer Science (R0)