2008
DOI: 10.15807/jorsj.51.1
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic for Balancing U-Shaped Assembly Lines With Parallel Stations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…The calculation results showed that heuristic approach appeared to perform slightly better for lower problem variability. Chen and Plebani (2008) proposed a heuristic approach based on four heuristic rules to solve UALBP with parallel stations. Avikal et al (2013) proposed a heuristic based on critical path method which minimized number of workstations and improved labor productivity.…”
Section: Literature Review and Analysismentioning
confidence: 99%
“…The calculation results showed that heuristic approach appeared to perform slightly better for lower problem variability. Chen and Plebani (2008) proposed a heuristic approach based on four heuristic rules to solve UALBP with parallel stations. Avikal et al (2013) proposed a heuristic based on critical path method which minimized number of workstations and improved labor productivity.…”
Section: Literature Review and Analysismentioning
confidence: 99%
“…This is the time interval between finishing two units or the maximum available time for the production of any work piece at any work station. When assigning tasks to the stations, we must ensure that the sum of the processing times of each task performed at the station does not exceed the cycle time (Chen and Plebani [1]). The Classic simple assembly line balancing problem definition goes as follows: given a set of tasks of various durations, a set of precedence constraints among the tasks, and a set of workstations, assign each task to exactly one station in such a way that no precedence constraint is violated and the assignment is optimal.…”
Section: Introductionmentioning
confidence: 99%