Optimal scheduling of casting sequence using genetic algorithms

Scheduling a casting sequence involving a number of orders with different casting weights and satisfying due dates of is an important optimization problem often encountered in foundries. In this article, we attempt to solve this complex, multi-variable, and multi-constraint optimization problem by using different implementations of genetic algorithms (GAs). In comparison with a mixed-integer linear programming solver, GAs with problem-specific operators are found to provide faster (with a subquadratic computational time complexity) and more reliable solutions to very large (more than 1 million integer variables) casting sequence optimization problems. In addition to solving the particular problem, the study demonstrates how problem-specific information can be introduced in a GA for solving complex real-world problems.