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.
Modelling and solving an FMS part selection problem
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.