Abstract
This paper discusses a part selection problem for a flexible manufacturing system with versatile machine tools but with no tool transportation devices. We propose a maximal network flow model with two side constraints. The model can be relaxed to either a maximal network flow problem or two independent 0-1 knapsack problems. Our computational results show that the latter relaxation significantly outperforms the former. Other factors affecting the solvability of the model are also examined. Finally, we show that our model can efficiently solve real-world part selection problems.
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.
