A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor

Okamura, Kenjirô; Yamashina, Hajime

doi:10.1080/00207547908919611

Cited by 120 publications

(37 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As for computational time and solution quality, these approaches are more suitable to handle larger instances than exact solution procedures. It has been observed in Okamura and Yamashina (1979) that the computational time of the local search approach increases not only with the number of workpieces and stations but also with the variability of processing times. Hence, this appears to be a critical factor for the performance of an algorithm.…”

Section: Literature Overviewmentioning

confidence: 99%

“…Dar-El and Bard et al 1992), worker displacement (cf. Okamura andYamashina 1979, Tsai 1995) and line stoppages (cf. Ohno 2000, Celano et al 2004).…”

Section: Literature Overviewmentioning

confidence: 99%

“…Improvement procedures like local search and tabu search have been successfully applied to MMS by using swap and insertion operators to manipulate a given sequence Okamura andYamashina 1979, Bard et al 1994). As for computational time and solution quality, these approaches are more suitable to handle larger instances than exact solution procedures.…”

Section: Literature Overviewmentioning

confidence: 99%

See 2 more Smart Citations

A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines

Gujjula

Werk

Günther

2011

International Journal of Production Research

View full text Add to dashboard Cite

Section: Literature Overviewmentioning

confidence: 99%

“…Dar-El and Bard et al 1992), worker displacement (cf. Okamura andYamashina 1979, Tsai 1995) and line stoppages (cf. Ohno 2000, Celano et al 2004).…”

Section: Literature Overviewmentioning

confidence: 99%

Section: Literature Overviewmentioning

confidence: 99%

See 1 more Smart Citation

A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines

Gujjula

Werk

Günther

2011

International Journal of Production Research

View full text Add to dashboard Cite

“…Thomopoulos [9], Dar-El and Cother [10], and Dar-El and Cucuy [11] focused on minimizing line length and proposed an integer programming and heuristic procedure to solve the problem. 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.…”

Section: Literature Reviewmentioning

confidence: 99%

Sequencing of mixed models on U-shaped assembly lines by considering effective help policies in make-to-order environment

2017

View full text Add to dashboard Cite

Abstract. Mixed-Model Assembly Line (MMAL) is a type of production line where a variety of products' models similar to products' characteristics are assembled in the same line. Many manufacturers tend to use mixed-model assembly line in their production lines, since this policy makes it possible to assemble various products in the Make-To-Order (MTO) environment. In this research, the sequence of U-type mixed-model assembly line is achieved through considering downstream help and storage of kits as e ective help policies for reducing total line stoppages and tardiness in delivery time of products to customers. Since this problem is NP-hard, hybrid GA-Beam search algorithm is developed to solve the problem. Numerical experiments are used to evaluate the performance and e ectiveness of the proposed algorithm. To the best of our knowledge, this is the rst study that considers getting help from downstream worker or using storehouse of kits, which has ready-toassemble parts in the conditions that workers cannot complete the remained task in the work horizon.

show abstract

“…Concerns about these two goals have been widely discussed in the literatures. For examples, the workload-leveling problem was addressed by Okamura and Yamashina (1978) (3) . Yano and Rachamadugu (1991) (4) concerned with the problem that aims to minimize the risk of assembly line stop.…”

Section: Introductionmentioning

confidence: 99%

A Sequencing Problem for Mixed-Model Assembly Line with the Aid of Relief-Man

Yoo

Shimizu

Hino

2005

JSME Int. J., Ser. C

View full text Add to dashboard Cite

There usually exist large variations in assembly times at mixed-model assembly lines depending on difference of product-models. To increase efficiency of line handling under such circumstance, this paper concerns with a sequencing problem for the mixed-model assembly lines where each product is supposed to be assembled within the same cycle time. Then, we formulate a new type of the sequencing problem minimizing the weighted sum of the line stoppage times and the idle times, and propose a new sequencing method with the aid of Relief Man (RM). Since the resulting problem refers to a combinational optimization problem, we develop a hybrid method that applies meta-heuristics like SA (Simulated Annealing) together with TS (Tabu Search) in a hierarchical manner. Finally, we examine the effectiveness of the proposed method through computer simulations and show the advantage of using RM against various changes in production environment.

show abstract

A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor

Cited by 120 publications

References 3 publications

A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines

A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines

Sequencing of mixed models on U-shaped assembly lines by considering effective help policies in make-to-order environment

A Sequencing Problem for Mixed-Model Assembly Line with the Aid of Relief-Man

Contact Info

Product

Resources

About