Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 18, Issue 3, Pages 411-420Publisher
SPRINGER
DOI: 10.1007/s10845-007-0030-z
Keywords
production line; buffer allocation; NP completeness; black-box complexity; genetic algorithm; branch-and-bound method; hybrid algorithm
Ask authors/readers for more resources
In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion depends on the average steady-state production rate of the line and the buffer equipment acquisition cost. We evaluate black-box complexity of this problem and propose a hybrid optimization algorithm (HBBA), combining the genetic and branch-and-bound approaches. HBBA is excellent in computational time. HBBA uses a Markov model aggregation technique for goal function evaluation. Nevertheless, HBBA is more general and can be used with other production rate evaluation techniques.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available