Retraining through the acquisition of new abilities

  • Jaime Gil-Aluja
Part of the Applied Optimization book series (APOP, volume 11)


Having made this extensive reference to adaptable qualification, let us now look at, although very briefly, and interesting aspect of retraining.


Human Resource Human Resource Management Travel Salesman Problem Universal Algebra Interactive Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    This is a normalisation by pairs, but not overall.Google Scholar
  2. 2.
    For more information: Pichat. E.:Algorithm for finding the maximal elements of a finite universal algebra. Inform Processing 68 Publ. North Holland, 1969.Google Scholar
  3. 3.
    This algorithm has been developed in Kaufmann, A., and Gil-Aluja, J.:Técnicas de gestión de empresa. Previsiones, decisiones y estrategias. Ed. Pirámide, Madrid, 1992, 395–398Google Scholar
  4. 4.
    It should be taken into account that in (18.7) the valuations of E3(4) have been situated before those relative to E5(2).Google Scholar
  5. 5.
    This scheme has been developed in: Gil-Aluja, J:Modelos no numéricos de asignación en la gestion de personal. II International Conference of SIGEF Santiago de Compostela, November 1995, 15–17.Google Scholar
  6. 6.
    Kaufmann, A. and Gil-Aluja, J:Introducción de la teoría de los subconjuntos borrosos a la gestion de empresas. Ed. Milladoiro, Santiago de Compostela, 3rd. ed. 157–158. Gil-Aluja, J:Selección de personal: el problema de la polivalencia y el de la uniformidad. Cuadernos CEURA. Madrid 1987, 8-10Google Scholar
  7. 7.
    König, D:Théorie der endlichen und unendlichen graphen (1916), later reprinted by Chelsea Publ. C°, New York, 1950. This work was mentioned by Kuhn H. W. in the article“The hungarian method for the assignment problem”, Naval Research Logistics Quaterly, vol. 2, 1–2, march-june 1955, 83–98. The algorythm principally was spread by the work of Kaufmann, A:Méthodes et Modèles de la Recherche Opérationelle, I. Dunod, Paris, 65–72.Google Scholar
  8. 8.
    Kaufmann, A., and Faure, R.:Invitation à la recherche opérationelle. Dunod, Paris, 1963, 91–103Google Scholar
  9. 9.
    We should remember that the continuous lines correspond to the framed zeros, and the dotted lines to the crossed out zeros.Google Scholar
  10. 10.
    Little, J.D.G . and others:An algorithm for the travelling salesman problem. L:O:R:S:A:, vol. 11, 1963, pages 972–989Google Scholar
  11. 11.
    As it is sufficiently well known we refer to the popular «salesman problem».Google Scholar
  12. 12.
    To the contrary only the positive numbers are considered.Google Scholar
  13. 13.
    For this, in what follows [30000, 35000] a deviation corresponds of [0,1], that is to say: [0, 0] for 0 and [30000, 35000] for 1.Google Scholar
  14. 14.
    For those who have fogotten this terminlogy we should recall the the number e=2.718281.. and n! =l x 2 x 3 x… x (n − 1) x(n). Likewise, since in order to simplify we have considered the hour as the unit of time we will have t= 1.Google Scholar
  15. 15.
    For greator security one could consult the conversion tables for the value χ2 in probability of acceptence (not rejection) of the law, as representative of the measured phenomena.Google Scholar
  16. 16.
    Given the fact that we are working with means, it should be seen that the number of breakdowns (robots that arrive at the repair stage) λ is not greater than the overall type of service S.μ.Google Scholar
  17. 17.
    It should be seen that on this occasion Ψ represents the «service factor» relative toS mechanics, In other cases, as will be seen furhter on, the service factor only one mechanic will be designated by ϕ.Google Scholar
  18. 19.
    From now onward will do without, the expression pn(t), for greater clarity, and substitute it with pn.Google Scholar
  19. 20.
    For a justification see Kaufmann, A:Méthodes et modèles de la recherche operationeile. Volume I Ed. Dunod, Paris 1970, 81Google Scholar
  20. 21.
    Provided the time unit selected is one hour.Google Scholar
  21. 22.
    This subject was tackled by Kaufmann, A. and Gil-Aluja, J. :Técnicas operativas de gestión para el tratamiento de la incertidumbre, Ed. Hispano-Europea, Barcelona, 1987. 349–371.Google Scholar
  22. 23.
    In many problems the magnitude v is introduced in this case the functions take on the form of:\(\gamma (s) = {C_1}.\overline v + {C_2}.\overline p = {C_1}.\sum\limits_{n - S + 1}^n {(n - S)} {p_n} + {C_2}.\sum\limits_{n - 0}^S {(S - n)} {p_0}\) \(\tau (S) = ({C_1}.\overline v + {C_2}.\overline p)T = {C_1}.\sum\limits_{n - S + 1}^n {(n - S)} {p_n} + {C_2}.\sum\limits_{n - 0}^S {((S - n)} {p_0})T\) Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Jaime Gil-Aluja
    • 1
  1. 1.Departament d’Economia i Organització d’EmpresesFacultat de Ciències Economiques i Empresarials de la Universität de BarcelonaBarcelonaSpain

Personalised recommendations