2013
DOI: 10.1016/j.cie.2013.08.008
|View full text |Cite
|
Sign up to set email alerts
|

A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
18
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(18 citation statements)
references
References 34 publications
0
18
0
Order By: Relevance
“…Manavizadeh et al [32] proposed an SA for a mixed model assembly U-line balancing type-I problem and compared the algorithm results with the exact method. Hamzadayi and Yildiz [33] used an SA algorithm for the line balancing problems and modeled sequencing in U-shaped assembly lines. Dou et al [34] proposed a discrete PSO for solving SALBP-1 and compared their results with GA. Kalayci and Gupta [35] used a PSO with a neighborhood-based mutation operator for solving the sequencedependent disassembly line balancing.…”
Section: Introductionmentioning
confidence: 99%
“…Manavizadeh et al [32] proposed an SA for a mixed model assembly U-line balancing type-I problem and compared the algorithm results with the exact method. Hamzadayi and Yildiz [33] used an SA algorithm for the line balancing problems and modeled sequencing in U-shaped assembly lines. Dou et al [34] proposed a discrete PSO for solving SALBP-1 and compared their results with GA. Kalayci and Gupta [35] used a PSO with a neighborhood-based mutation operator for solving the sequencedependent disassembly line balancing.…”
Section: Introductionmentioning
confidence: 99%
“…Mosadegh et al [29] solved simultaneous balancing and sequencing of mixed-model assembly line in order to minimize total utility work. Hamzadayi and Yildiz [30] simultaneously solved balancing and sequencing for an e cient implementation of a mixed-model U-shaped assembly line in a JIT (Just In Time) environment. Dong et al [31] addressed the line balancing problem and the model sequencing problem jointly to minimize the expectation of work overload time for a given combination of cycle time and number of workstations.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Therefore, line balancing and model sequencing problems have been simultaneously considered by some of the researchers to find suitable balances for mixed-model U-lines. Kim et al [18] and Hamzadayi and Yildiz [24] proposed evolutionary based algorithms while Kara et al [19] and Hamzadayi and Yildiz [26] proposed simulated annealing algorithm based methods to solve the problem. Hamzadayi and Yildiz [24,26] minimised number of workstations needed while Kim et al…”
Section: Review Of the Literaturementioning
confidence: 99%
“…Hamzadayi and Yildiz [26] illustratively showed that ADW is an insufficient performance criterion for evaluating the performance of the solutions although it is a frequently used performance measure in the literature.…”
Section: Review Of the Literaturementioning
confidence: 99%