Solving a concrete sleepers production scheduling by genetic algorithms

Solving a concrete sleepers production scheduling by genetic algorithms

0.00 Avg rating0 Votes
Article ID: iaor2009248
Country: Netherlands
Volume: 179
Issue: 3
Start Page Number: 605
End Page Number: 620
Publication Date: Jun 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics: genetic algorithms, transportation: rail
Abstract:

PRECON S.A. is a manufacturing company devoted to produce prefabricated concrete parts for several industries as railway transportation and agricultural industries. Recently, PRECON S.A. signed a contract with RENFE, the Spanish National Railway Company, to manufacture pre-stressed concrete sleepers for the sidings of the new railways of the high speed train. The scheduling problem associated with the manufacturing process of the sleepers is very complex, since this involves several constraints and objectives. These constraints are related to production capacity, the quantity of available moulds, demand satisfaction and other operational constraints. The two main objectives are related to the way to maximize the utilization of manufacturing resources and minimize mould movements.

Reviews

Required fields are marked *. Your email address will not be published.