A dynamic programming operations management algorithim in a tile manufacturing industry: Case study of a tile company

A Dynamic Programming Operations Management Algorithim in a Tile Manufacturing Industry: Case Study of a Tile Company is a published article of the Applied mathematics department.,This research paper combined optimization algorithms, capacity planning, scheduling and discrete event simulation in the tile manufacturing plant, by determining the tooling, personnel and equipment resources that are required for optimal efficiency in the manufacturing process. A Dynamic Programming knapsack algorithm is used to optimally select jobs (in a 12-stage manufacturing process) such that they contribute to the production plan within a specified duration of time (28 days). This was done in such a way that each stage contributed to an overall optimal production plan for the tile manufacturing process with minimal costs. It is recommended that the designing of production processes should match volume-variety requirements, process design positioning and the incorporation of appropriate process technology. Furthermore job designs, recognising process variability, appropriately configuring process tasks, capacity and adopting a minimal cost task-precedence are also recommended.