Abstract
SUMMARY To obtain an approximate solution for a large-scale job-shop scheduling problem the decomposition method was investigated. This means that an original problem is decomposed into subproblems, which are solved separately, and then the solution of the original problem is composed from the subproblems' solutions. Different methods to decompose the problem were tested by computational experiments and evaluated from the viewpoint of the goodness of schedule and computation time.
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.
