Research Article
Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines
Algorithm 2
ICBD.
or original master problem.
(1) begin | (2) h← 0; UB ← +∞; stop ← false; | (3) while (stop = false) do | (4) ; | (5) solve ; | (6) for until do // multi-cut | (7) evaluation of subproblems (Algorithm 1); | (8) end-for | (9) evaluate the terminating condition; | (10) end-while | (11) end |
|