2011
DOI: 10.1007/s00170-011-3802-8
|View full text |Cite
|
Sign up to set email alerts
|

Buffer allocation in unreliable production lines based on design of experiments, simulation, and genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0
13

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 57 publications
(51 citation statements)
references
References 52 publications
0
38
0
13
Order By: Relevance
“…Chan and Ng (2002) compared buffer allocation strategies for maximized the production rate in serial production line. Amiri and Mohtashami (2012) presented a multi-objective formulation of the buffer allocation problem in a serial line in which unreliable machines, finite buffer and exponential service time were assumed. They developed a meta-model for estimating production rate based on discrete event simulation, and used genetic algorithm combined to line search method to solve the multi-objective model, maximizing production rate and minimizing buffer size, and determining the optimal (or near optimal) size of each buffer storage.…”
Section: Figure 1 Example Of Crankshaftmentioning
confidence: 99%
“…Chan and Ng (2002) compared buffer allocation strategies for maximized the production rate in serial production line. Amiri and Mohtashami (2012) presented a multi-objective formulation of the buffer allocation problem in a serial line in which unreliable machines, finite buffer and exponential service time were assumed. They developed a meta-model for estimating production rate based on discrete event simulation, and used genetic algorithm combined to line search method to solve the multi-objective model, maximizing production rate and minimizing buffer size, and determining the optimal (or near optimal) size of each buffer storage.…”
Section: Figure 1 Example Of Crankshaftmentioning
confidence: 99%
“…In a new one, I proposed a methodology for buffer allocation problem in unreliable production systems [7] regarding general distribution function for time-dependent parameters of production system. Aksoy and Gupta consider optimal management of remanufacturing systems with server vacations.…”
Section: Introductionmentioning
confidence: 99%
“…Several research works [15,21] can be cited as applications of simulation models to search the solution of BAP. The study of the transference lines without restrictions in the stations and finite temporal intermediate buffer was performed by Hillier and So in 1991 and Hillier et al in 1993 [33,34].…”
Section: Complexitymentioning
confidence: 99%
“…The typical methods applied in this area include Tabu Search [11][12][13], Simulated Annealing [14], Genetic Algorithms [15], and Ant Colony Optimization [16]. In order to search for the best solution space, a recent tendency is to hybridize metaheuristics with other methods like nested partitions [17], the Branch and Bound method [18], and the local search [15]. These hybrid search methods have an advantage over the traditional ones because they can jump over local optimal solutions in the search of the global optimal.…”
Section: Related Workmentioning
confidence: 99%