Solving a Concrete Sleepers Production Scheduling by Genetic Algorithms
UPF Economics and Business Working Paper No. 736
26 Pages Posted: 12 Jul 2004
Date Written: January 2004
PRECON S.A is a manufacturing company dedicated to produce prefabricated concrete parts to several industries as rail transportation and agricultural industries.Recently, PRECON signed a contract with RENFE, the Spanish National Rail Transportation Company to manufacture pre-stressed concrete sleepers for siding of the new railways of the high speed train AVE. The scheduling problem associated with the manufacturing process of the sleepers is very complex since it involves several constraints and objectives. The constraints are related with production capacity, the quantity of available moulds, satisfying demand and other operational constraints. The two main objectives are related with maximizing the usage of the manufacturing resources and minimizing the moulds movements. We developed a deterministic crowding genetic algorithm for this multiobjective problem. The algorithm has proved to be a powerful and flexible tool to solve the large-scale instance of this complex real scheduling problem.
Keywords: Production scheduling, genetic algorithms
JEL Classification: L61, L23, D83
Suggested Citation: Suggested Citation