1997
DOI: 10.1016/s0360-8352(96)00193-3
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for sequencing mixed models on an assembly line in a JIT production system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0
2

Year Published

2003
2003
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(27 citation statements)
references
References 17 publications
0
25
0
2
Order By: Relevance
“…Okamura and Yamashina [12] o ered a heuristic approach for minimizing line stoppages problem. Xiaobo and Ohno [4] minimized the total line stoppages time for a mixed-model assembly line in a JIT production system. They assumed that if a worker could not nish his/her work within the work zone, he/she should stop the line at the downstream boundary of his/her work zone until the remained work was nished.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Okamura and Yamashina [12] o ered a heuristic approach for minimizing line stoppages problem. Xiaobo and Ohno [4] minimized the total line stoppages time for a mixed-model assembly line in a JIT production system. They assumed that if a worker could not nish his/her work within the work zone, he/she should stop the line at the downstream boundary of his/her work zone until the remained work was nished.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraint (4) shows that if stoppage does not occur, position of the product will be in the starting point of the next station. Also, if stoppage occurs, position of the product will be higher than the length of the station.…”
Section: Scenario 1: Applying Equal Launching Intervalsmentioning
confidence: 99%
See 1 more Smart Citation
“…This model can be used only for small size problems due to the limitations of operations research software with respect to handling the number of variables and constraints, which are present in the integer programming model. Xiaobo and Ohno (1997) have considered similar work on mixed model assembly line sequencing problem with conveyor stoppages. They proposed branch and bound algorithm, and simulated annealing algorithm for finding the optimal solution and suboptimal solution of the mixedmodel sequencing problem, respectively to minimize the total conveyor stoppage time.…”
Section: Empirical Theorymentioning
confidence: 99%
“…determining the order in which products have to be introduced into the assembly line) increases the performance of such a line. Sequencing is usually carried out with the two primary goals such as levelling the workload (total operation time) at each workstation on the assembly line to reduce line inefficiencies such as idleness, utility work, work deficiency and work congestion (Thomopoulos, 1967;Macaskill, 1973, Bolat andYano, 1992;Xiaobo and Ohno, 1997;Hyun et al, 1998;Sarker and Pan, 2001;Erel et. al., 2007), keeping a uniform parts usage (Xiaobo, et al, 1999;Tamura, et al, 1999;Jin and Wu, 2002;Kurashige, et al, 2002;Ventura and Radhakrishnan, 2002).…”
Section: Introductionmentioning
confidence: 99%