Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports

Algorithm 3

Transform schedule into job permutation.

Step  1: Let be the set of scheduled jobs on mechanic , initialize corresponding

    earliest available time to 0, calculate minimum earliest available time and set initial

    permutation ;

Step  2: Identify the mechanic

     Step  2.1 Select mechanic such that , if multiple mechanics satisfy this,

      then goto Step .2;

     Step  2.2 For each mechanic , compute + the setup time for first job in , then

      select mechanic with minimum , if multiple mechanics satisfy this, then goto Step .3

     Step  2.3 Select the mechanic with minimum mechanic index.

Step  3: Delete the first job in and append it to P, update , and . If ,

    then mechanic is not in consideration in further iterations;

Step  4: Repeat Steps 2 and 3, until a complete permutation is derived.