𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel branch-and-bound methods for thejob-shop scheduling problem

✍ Scribed by Michael Perregaard; Jens Clausen


Book ID
110379273
Publisher
Springer US
Year
1998
Tongue
English
Weight
178 KB
Volume
83
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Branch and bound methods for a search pr
✍ Alan R. Washburn πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch