Sequencing and cost reduction using a Knapsack formulation and dynamic programming

dc.contributor.other	University of Pretoria. Faculty of Engineering, Built Environment and Information Technology. Dept. of Industrial and Systems Engineering
dc.contributor.upauthor	Eicker, Albert
dc.date.accessioned	2010-02-01T11:56:44Z
dc.date.available	2010-02-01T11:56:44Z
dc.date.created	2009-11
dc.date.issued	2010-02-01T11:56:44Z
dc.description	Thesis (B Eng. (Industrial and Systems Engineering))--University of Pretoria, 2009.	en
dc.description.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.	en
dc.identifier.uri	http://hdl.handle.net/2263/12822
dc.language	en
dc.language.iso	en	en
dc.rights	Copyright: University of Pretoria	en
dc.subject	Cost minimisation	en
dc.subject	Seqeuncing	en
dc.subject	Feasibility	en
dc.subject	Knapsack model	en
dc.subject.lcsh	Dynamic programming
dc.subject.lcsh	Cost control
dc.title	Sequencing and cost reduction using a Knapsack formulation and dynamic programming	en
dc.type	Text	en