Year-end Sale % OFF 
Abstract
The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.
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.
