Algorithm

This section documents the design and implementation of the algorithm portion of the project. For information more specific to the algorithms place in the overall software architecture, see this page.

In the end we have decided to use multiple algorithms. Our design lets us switch out what algorithm is being used depending on what the user has specified. If the visualisation is on, sequential branch-and-bound is used. If the algorithm is to be ran sequentially, A* is used. If the algorithm is to be run in parallel, parallel branch-and-bound is used. More descriptions on these algorithms are on Ideas and Approaches. These algorithms all run on an allocation-ordering search space.

Subsections

• Ideas and Approaches
• Schedule representation
• Pruning Techniques
• Allocation Ordering