Optimization of the Casting Length of Billets and Computation of Minimum Number of Steel Batches

摘要

This paper deals with the optimization of the casted billet's lengths, in the context of diverse received orders. Linear programming is used in order to solve the optimization problem, such that minimum cost for the optimal lengths results. A technological constraint is that the number of resulted billets for each casted length must be an integer one. The authors also propose an algorithm for determining the number of batches of liquid steel needed for covering all pieces at optimal casting lengths for diverse orders, and also the scheduling order of the casting process.