Name
Title | ||
|---|---|---|
Comments on "Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix". |
Abstract | ||
|---|---|---|
Four new heuristic functions of A* algorithm are proposed in the above paper. The authors claim that these functions are more efficient in terms of the search space and computation time than that of using resource cost reachability (RCR) matrix. However, it is not always true for one of the proposed functions, hLBR(M). This comment gives some counter examples to demonstrate it. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cie.2013.11.012 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Petri net,Flexible manufacturing systems,A* algorithm,Heuristic search | Incremental heuristic search,Heuristic,Mathematical optimization,Upper and lower bounds,Computer science,Matrix (mathematics),Beam search,Reachability,Counterexample,A* search algorithm | Journal |
Volume | ISSN | Citations |
67 | 0360-8352 | 1 |
PageRank | References | Authors |
0.36 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bo Huang | 1 | 12 | 2.63 |
| Rongxi Jiang | 2 | 10 | 1.18 |
| Gongxuan Zhang | 3 | 94 | 19.89 |