Double Girder Bridge Crane with Double Cycling: Scheduling Strategy and Performance Evaluation

Algorithm 1

(1) Scheduling and in double cycling. Obtain . //single bay scheduling

(2) Compute the timetable and makespan for each .

(3) While (there is any activity in )  //two bays timetabling

  (3.1) Pick the earliest activities and in and respectively.

  (3.2) If there is no conflict between activities and

   (3.2.1) If

      (3.2.1.1) Add activities () into and perform.

      (3.2.1.2) Remove activities and from .

    (3.2.2) Else    //.

      (3.2.2.1) Add activities () into and perform.

      (3.2.2.2) Remove activities and from .

  (3.3) Else    //there exist a conflict between activities and

    (3.3.1) Calculate the blocking time on /.          //delay one lifting

    (3.3.2) If <  //minimum cost strategy

      (3.3.2.1) Add activity j into and perform.

      (3.3.2.2) Remove activity from .

      (3.3.2.3) Right shift activity and update makespan .

    (3.3.3) Else

      (3.3.3.1) Add activity into and perform.

      (3.3.3.2) Remove activity from .

      (3.3.3.3) Right shift activity j and update makespan .

(4) .

(5) Return .