Question: How can I increase the depth limit of a Branch and Bound linear programming routine?

Good day to you all ..

I built a routine to solve a machine-job allocation problem. This involves binary decision variables and an objective function to minimize the maximum completion time (makespan).The model assumes that each job, n, has a sequence of operations that must be processed in a specific order on a specific machine, m.

Consider (for example) the case of 5 machines and 3 jobs. Every job, 1, 2, and 3, visits machines 1 to 5 in order, with the processing times specified by the matrix, P. Maple successfully returns the required solutions for various combinations up to this scale.

However, when I encounter the 8-machine, 5-job problem, Maple stops (after 30 minutes of processing time) and returns the following error:

"Maximal depth, 182, of branch and bound search is too small; use depthlimit option to increase depth."

I have attempted to modify the depth limit (to a value exceeding 182) but without success ... I cannot resolve this problem. Can somebody advise on how to fix this - if possible? The worksheet in question is attached.

Thanks for reading.

MaplePrimes_Nov_16.mw