Abstract
The scheduling of lot-sizes in multistage production structures with time-varying costs and nonzero lead times is formulated as a mixed zero-one linear program for which strong valid inequalities are derived. A fast algorithm that selects a most-violated inequality is developed and used repeatedly in a cutting plane algorithm. The efficiency of the cutting plane algorithm in accelerating a branch and bound search is analyzed in an example. The example shows the strength of the cuts in terms of reduction of the number of nodes explored to achieve a near-optimal solution. >
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.
