| Article ID: | iaor20022804 |
| Country: | China |
| Volume: | 29 |
| Issue: | 1 |
| Start Page Number: | 34 |
| End Page Number: | 39 |
| Publication Date: | Jan 2001 |
| Journal: | Journal of Hohai University |
| Authors: | Hong Yuzheng |
| Keywords: | project management |
In a way that is similar to the general job shop scheduling problem, this paper constructs a gap-network consisting of nodes, shortest paths and adjacent paths. Through analysis of this network, the local optimal solution of the most general and complex scheduling problem is discussed. Compared with the heuristics, which have been widely used so far, the present method is a local optimization method; and compared with the current optimization methods, it is of more value in practice.