An evolutionary algorithm for the sequence coordination in furniture production

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2264, Issue , 2001, Pages 91-105

  Meloni, Carlo ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

Evolutionary algorithms; Manufacturing systems; Sequencing

Indexed keywords

MANUFACTURE; STOCHASTIC SYSTEMS;

FURNITURE PRODUCTION; MATERIAL FLOW; META-HEURISTIC APPROACH; SEQUENCING;

EVOLUTIONARY ALGORITHMS;

EID: 23044531427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45322-9_6     Document Type: Conference Paper

References (15)

1. 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`a La Sapienza, Roma.
2. 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.
3. 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.
4. Bertossi, A.A., 1981, The edge hamiltonian problem is NP-complete, Information Processing Letters, (13), 157–159.
5. Chatterjee, S., Carrera, C., Lynch, L.A., 1996, Genetic algorithms and travelling salesman problems, European Journal of Operational Research (93), 490-510.
6. Crama, Y., Oerlemans, A.G., Spieksma, F.C.R., 1996, Production planning in automated manufacturing, Springer, Berlin.
7. 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.
8. Hertz, A., Kobler, D., 2000, A framework for the description of evolutionary algorithms, European Journal of Operational Research (126), 1-12.
9. Holland, J.H., 1976, Adaption in natural and artificial systems, University of Michigan Press, Ann Arbor MI.
10. 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.
11. Korte, B., Vygen, J., 2000, Combinatorial Optimization: Theory and Algorithms, Springer, Berlin.
12. Meloni, C., 2001, The splittance of a graph and the D-Trails problem. Preprint n.449, Centro Vito Volterra, Universit`a Tor Vergata, Roma.
13. Reeves, C.R., 1993, Modern heuristic tecniques for combinatorial problems, Blackwell Scientific Pubblications, Oxford.
14. Reeves, C.R., 1995, A genetic algorithm for flowshop sequencing, Computers And Operations Research, 22, 5–13.
15. Wolsey, L.A., 1998, Integer Programming, Wiley-Interscience Publication, New York.