Abstract
A flexible manufacturing and operator scheduling problem is introduced and solved. The principal concern is to schedule operators over time to various activities of a manufacturing system for the purpose of optimizing some steady-state criteria. In mathematical terms, the problem is modeled as a deterministic, infinite horizon, discrete dynamic program. Our solution procedure is to convexify the problem to obtain a linear program, and then to deconvexify the solution of the linear program over time to arrive at an optimal solution. Apparent loss in objective value due to the deconvexifications is circumvented with buffer inventories. The procedure is reduced to solving a sequence of linear programs and the complexity is stated in these terms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
