Research Article
Two-Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue
| (1) | /∗ Initial Solution ∗/ | | (2) | Create a sequence for A jobs according to the WSPT rule | | (3) | for k = 1 to do | | (4) | Select job | | (5) | ifthen | | (6) | Remove job i from sequence | | (7) | end if | | (8) | end for | | (9) | Create a sequence for B jobs according to the EDD rule | | (10) | Create null sequences and | | (11) | for k = 1 to do | | (12) | Select job | | (13) | ifthen | | (14) | append job i in sequence | | (15) | else | | (16) | append job i in sequence | | (17) | end if | | (18) | end for | | (19) | Update by arranging jobs in nondecreasing order of ratio | | (20) | Create initial sequence | | (21) | /∗ Feasibility phase ∗/ | | (22) | //Calculate the weighted number of tardy jobs for | | (23) | for k = 1 to do | | (24) | ifthen | | (25) | break k loop | | (26) | end if | | (27) | | | (28) | //Calculate the weighted number of tardy jobs for | | (29) | end for | | (30) | return solution |
|
