Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm

Algorithm 1

Original local search (LS1).

Procedure Original local search ()

 improve true;

 While (improve = true) do

  improve false;

  For    to    do

   remove a task at random from (Different from the last selected one);

     best permutation by inserting into all possible positions of ;

   If  ;

     improve true;

   End if

  End for

 End while