Abstract
This paper considers a production system where several products are manufactured over several time periods with specified demand levels. The minimal changeover and holding cost problem is formulated as a mixed integer program model. An efficient heuristic method is proposed by decomposing the problem into a pair of network subproblems. Some computational results showing the efficiency of the method are presented for a set of test problems. Finally, extensions to the general problem are discussed.
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.
