A new branch and bound algorithm for loading problems in flexible manufacturing systems

Loading problems in flexible manufacturing systems involve assigning operations for selected part types and their associated tools to machines or machine groups. One of the objectives might be to maximize the expected production rate (throughput) of the system. Because of the difficulty in dealing with this objective directly, a commonly used surrogate objective is the closeness of the actual workload allocation to the continuous workload allocation that maximizes throughput. We test several measures of closeness and discuss correlations between these measures and throughput. Using the best measure, we show how to modify an existing branch and bound algorithm which was developed for the case of equal target workloads for all machine groups to accommodate unequal target workloads. We also develop a new branch and bound algorithm which can be used for both types of problems. The efficiency of the algorithm in finding optimal solutions is achieved through the application of better branching rules and improved dominance results. Computational results on randomly generated test problems indicate that the new algorithm performs well. © 1994 Kluwer Academic Publishers.
Publisher
Springer Verlag
Issue Date
1994-10
Language
ENG
Citation

INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, v.6, no.4, pp.361 - 381

ISSN
0920-6299
URI
http://hdl.handle.net/10203/7592
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 467
  • Download : 1
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0