Sequencing and cost reduction using a Knapsack formulation and dynamic programming

Abstract

The problem of cost minimisation through sequencing different nested patterns according to priority and requirements are addressed in this project.The feasibility of scheduling these nest's cutting order as to minimise the number of sheets required as well as to reduce the total production cost in-curred, is to be determined and compared to current sequencing methods as are currently employed at Aerosud. The method that is implemented to address this problem is a dynamic programming model that incorporates a knapsack formulation at its core.