An approximate solution of machine scheduling problems by decomposition method
- 1 January 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 15 (6) , 599-608
- https://doi.org/10.1080/00207547708943152
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: