Article ID: | iaor20043024 |
Country: | Netherlands |
Volume: | 1 |
Issue: | 2 |
Start Page Number: | 89 |
End Page Number: | 104 |
Publication Date: | Apr 2002 |
Journal: | Journal of Mathematical Modelling and Algorithms |
Authors: | Dolgui A., Eremeev A., Kolokolov A., Sigaev V. |
Keywords: | genetic algorithms |
In this paper, we consider a flow-line manufacturing system organized as a series of workstations separated by finite buffers. The failure and repair times of machines are supposed to be exponentially distributed. The production rate of each machine is deterministic, and different machines may have different production rates. The buffer allocation problem consists in determining the buffer capacities with respect to a given optimality criterion, which depends on the average production rate of the line, the buffer acquisition and installation cost, and the inventory cost. For this problem we propose a genetic algorithm where the tentative solutions are evaluated with an approximate method based on the Markov-model aggregation approach.