haku: @indexterm Scheduling / yhteensä: 635
viite: 360 / 635
| Tekijä: | Ng, S.M. |
| Otsikko: | Bond energy, rectilinear distance and a worst-case bound for the group technology problem |
| Lehti: | Journal of the Operational Research Society
1991 : JUL, VOL. 42:7, p. 571-578 |
| Asiasana: | PRODUCTION SCHEDULING INTEGER PROGRAMMING TRAVELLING SALESMAN PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | The central idea of group technology /GT/ is to identify the similarity of products or parts and manufacturing processes, and to group the machines and parts into families so that there is as little inter-family activity as possible. The machine-part relation in the group technology problem can be represented by a 0-1 matrix A where the rows represent the machines and the columns the parts. One frequently used objective function is the "total bond energy" between the rows and the columns, which is a quadratic assignment problem formulation. It is shown that this formulation is equivalent to solving rectilinear travelling-salesman problems. |
SCIMA