Research Article
Two-Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue
| (1) | Initialization | | (2) | Set k = 0, m = 50, c1 = 0.8, c2 = 0.8, | | (3) | Initialize | | (4) | Main phase | | (5) | do while () | | (6) | k = k + 1 | | (7) | for i = 1 to m do | | (8) | Generate sequence | | (9) | Local search() | | (10) | Update and , | | (11) | Update | | (12) | end for | | (13) | end do | | (14) | return solution |
|
