Comparison of the Classical Algorithm with the Training Algorithm in Scheduling Problem ADI Production

Abstract

A classical algorithm Tabu Search was compared with Q Learning (named learning) with regards to the scheduling problems in the Austempered Ductile Iron (ADI) manufacturing process. The first part comprised of a review of the literature concerning scheduling problems, machine learning and the ADI manufacturing process. Based on this, a simplified scheme of ADI production line was created, which a scheduling problem was described for. Moreover, a classic and training algorithm that is best suited to solve this scheduling problem was selected. In the second part, was made an implementation of chosen algorithms in Python programming language and the results were discussed. The most optimal algorithm to solve this problem was identified. In the end, all tests and their results for this project were presented.

Keywords

• production scheduling
• austempered ductile iron
• iron castings
• foundry industry
• training algorithm
• tabu search