Linked Data Explorer
A flexible manufacturing and operator scheduling model solved by deconvexification over time
Abstract: "A flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, mixed integer, infinite horizon dynamic program. Our solution procedure is first to convexify the problem, then to apply linear programming, and finally to deconvexify the solution over time to arrive at an optimal solution. Apparent loss in the object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity is stated in these terms."
- "Abstract: "A flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, mixed integer, infinite horizon dynamic program. Our solution procedure is first to convexify the problem, then to apply linear programming, and finally to deconvexify the solution over time to arrive at an optimal solution. Apparent loss in the object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity is stated in these terms.""@en
- "A flexible manufacturing and operator scheduling model solved by deconvexification over time"
- "A flexible manufacturing and operator scheduling model solved by deconvexification over time"@en