𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

✍ Scribed by Kohler, Walter H.; Steiglitz, Kenneth

Book ID
121852372
Publisher
Association for Computing Machinery
Year
1974
Tongue
English
Weight
929 KB
Volume
21
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi