Solving a concrete sleepers production scheduling by genetic algorithms


Autoria(s): Pérez-Vázquez, M. E.; Gento-Municio, A. M.; Ramalhinho-Lourenço, Helena
Contribuinte(s)

Universitat Pompeu Fabra. Departament d'Economia i Empresa

Data(s)

15/09/2005

Resumo

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

Identificador

http://hdl.handle.net/10230/1111

Idioma(s)

eng

Direitos

L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons

info:eu-repo/semantics/openAccess

<a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a>

Palavras-Chave #Operations Management #production scheduling #genetic algorithms.
Tipo

info:eu-repo/semantics/workingPaper