haku: @indexterm Scheduling / yhteensä: 635
viite: 280 / 635
| Tekijä: | |
| Otsikko: | Adapting branch-and-bound for real-world scheduling problems. |
| Lehti: | Journal of the Operational Research Society
1993 : MAY, VOL. 44:5, p. 483-490 |
| Asiasana: | BRANCH AND BOUND METHODS SCHEDULING MATHEMATICAL PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | Many sequencing and scheduling problems can be formulated as 0-1 integer programs and, in theory, solved using a branch-and-bound approach. In practice, real-world instances of these problems are usually solved using heuristics. Here are demonstrated the benefits of incorporating an intuitive, user-controlled variable-tolerance into a depth-first branch-and-bound algorithm. The tolerance comprises two components: a variable depth tolerance and a variable breadth tolerance. A sample scheduling problem is thoroughly analysed. |
SCIMA