Research Article
Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines
| (1) Given a solution of the master problem; | | (2) ; | | (3) for until do | | (4) ; | | (5) if (has sub-cycle) then add CBC; | | (6) if then ; | | (7) end-for | | (8) if then ; |
|