Abstract
In the material flow of a plant, parts are grouped in batches, each having as attributes the shape and the color. In both departments, a changeover occurs when the attribute of a new part changes. The problem consists in finding a common sequence of batches optimizing an overall utility index. A metaheuristic approach is presented which allows to solve a set of real-life instances and performs satisfactorily on a large sample of experimental data.
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
Agnetis, A., Detti, P., Meloni, C., Pacciarelli, D., 1999, Set-up coordination between two stages of a supply chain. Tech.Rep. n. 32-99, Dipartimento di Informatica e Sistemistica, Università La Sapienza, Roma.
Agnetis A., Detti P., Meloni C., Pacciarelli D., 2001, A linear algorithm for the hamiltonian completion number of the line graph of a tree. Information Processing Letters 79, 17–24.
Agnetis A., Detti P., Meloni C., Pacciarelli D., 2001, The minimum cardinality dominating trail set problem (MDTS). Proceedings of the AIRO 2001 conference, CUEC, Cagliari.
Bertossi, A.A., 1981, The edge hamiltonian problem is NP-complete, Information Processing Letters, (13), 157–159.
Chatterjee, S., Carrera, C., Lynch, L.A., 1996, Genetic algorithms and traveling salesman problems, European Journal of Operational Research (93), 490–510.
Crama, Y., Oerlemans, A.G., Spieksma, F.C.R., 1996, Production planning in automated manufacturing, Springer, Berlin.
Detti, P., Meloni, C., 2001, A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. In: H. Broersma, U. Faigle, J. Hurink and S. Pickl (Eds.) Electronical Notes in Discrete Mathematics vol 8 (2001), Elsevier Science Publishers.
Hertz, A., Kobler, D., 2000, A framework for the description of evolutionary algorithms, European Journal of Operational Research (126), 1–12.
Holland, J.H., 1976, Adaption in natural and artificial systems, University of Michigan Press, Ann Arbor MI.
Jawahar, N., Aravindan, P., Ponnambalam, S.G., Aravind Karthikeyan, A., 1998, A genetic algorithm-based scheduler for setup-constrained FMC, Computers in Industry (35), 291–310.
Korte, B., Vygen, J., 2000, Combinatorial Optimization: Theory and Algorithms, Springer, Berlin.
Meloni, C., 2001, The splittance of a graph and the D-Trails problem. Preprint n.449, Centro Vito Volterra, Università Tor Vergata, Roma.
Reeves, C.R., 1993, Modern heuristic tecniques for combinatorial problems, Blackwell Scientific Pubblications, Oxford.
Reeves, C.R., 1995, A genetic algorithm for flowshop sequencing, Computers And Operations Research, 22, 5–13.
Wolsey, L.A., 1998, Integer Programming, Wiley-Interscience Publication, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meloni, C. (2001). An Evolutionary Algorithm for the Sequence Coordination in Furniture Production. In: Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2001. Lecture Notes in Computer Science, vol 2264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45322-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-45322-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43025-4
Online ISBN: 978-3-540-45322-2
eBook Packages: Springer Book Archive