Research Article
Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports
Step 1: Select the first unscheduled job in the permutation and assign it to the earliest available mechanic, | if multiple mechanics are available, then goto Step ; | Step 2: Assign it to the earliest available mechanic with minimum setup time, if multiple mechanics share | the minimum setup time, then goto Step ; | Step 3: Assign it to the one with minimum mechanic index; | Step 4: Then determine the start time with respect to its release time; | Step 5: Repeat Steps –4 until all jobs are scheduled. |
|