Research Article
A Multiobjective Optimization Algorithm to Solve the Part Feeding Problem in Mixed-Model Assembly Lines
Algorithm 2
Second stage: minimizing the inventory level.
Identify the AT and NA according to (viii) and (ix), respectively. | | (viii) | | (ix) | While AT is not empty | Select the first possible tour (which is in the AT) and find the number of removed consecutive tour(s) | after the selected tour () according to (x). | | (x) | Keep as many bins as necessary to satisfy (xi) and transfer the extra bins to the | next available tour. Update all the information related to the current tour and the tour that received | the extra bins. Remove the selected tour from AT. | | (xi) | End while | For to 2 | If
(xii) is not satisfied | | (xii) | While
(xii) is not satisfied | Identify the nearest available tour before the current tour () that satisfies (iv) and (xiii). | | (xiii) | Create the FICL according to (xiv). | | (xiv) | Use the solution string and select a reference that is in the FICL | and transfer one bin of the selected reference to tour . | Update the information related to the current tour and the tour that received the selected reference | End while | End if | End for |
|