1
Download Visualising the `Shifting Bottleneck` Scheduling Algorithm
Transcript
Chapter 5 Implementation 5.1 Iteration 1 5.1.1 Goals of Iteration 1 Iteration 1 of the implementation focused on the scheduling aspect of the software. The goals were to: • Create the internal representation of the disjunctive graph • Adapt the Boost Graph Library DAG Shortest Path algorithm to a longest path algorithm which will accept the disjunctive graph as input • Write code to transfer subproblem solutions from LiSA • Combine the modules to implement the Shifting Bottleneck procedure 5.1.2 Subproblem and LiSA Branch & Bound It was decided to attempt an automatic method of data transfer from the start, rather than waste time implementing a clumsy manual interface that would require the user to have a full install of LiSA and input both the parameters into LiSA and then import the results back into the software. As LiSA algorithms are all implemented as separate executables, only the Branch & Bound executable itself 26
