buffer sizing
Recently Published Documents


TOTAL DOCUMENTS

162
(FIVE YEARS 21)

H-INDEX

19
(FIVE YEARS 2)

2022 ◽  
Vol 135 ◽  
pp. 104134
Author(s):  
Hongbo Li ◽  
Yiwu Cao ◽  
Qiao Lin ◽  
Hanyu Zhu
Keyword(s):  

10.6036/10223 ◽  
2021 ◽  
Vol 96 (6) ◽  
pp. 563-563
Author(s):  
HARRY AGUILAR GAMARRA ◽  
ALBERTO GARCIA VILLORIA ◽  
RAFAEL PASTOR MORENO

In industry there are production systems consisting of more than one assembly line. If these are close together, it is possible for an operator to perform tasks from two adjacent lines assigned to his station (this will be a "multi-line station")


2021 ◽  
Author(s):  
Qingkai Meng ◽  
Kun Qian ◽  
Wenxue Cheng ◽  
Fengyuan Ren
Keyword(s):  

2021 ◽  
pp. 102232
Author(s):  
Bruce Spang ◽  
Serhat Arslan ◽  
Nick McKeown
Keyword(s):  

2021 ◽  
Vol 9 (1) ◽  
pp. [10 p.]-[10 p.]
Author(s):  
RAFAEL PASTOR MORENO ◽  
HARRY AGUILAR GAMARRA ◽  
ALBERTO GARCIA VILLORIA

ABSTRACT: Parallel Assembly Lines with multi-line stations (PALBs) have been widely studied in recent years because PALBs can help improve the efficiency of a production system. However, the need of buffers has not been considered in the PALBP literature. In this study, for the first time in the literature, it is shown and demonstrated the need to consider the use of buffers in this type of line when their cycle times are different. Moreover, the buffer sizing problem in a multi-line workstation is presented and formalized. It is shown that the sequencing and scheduling of the task influences the buffer size. Finally, the designed resolution method is shown: solve a mixed integer linear programming model with a commercial software, with the objective of minimizing the size of the buffers. Keywords: Parallel assembly lines balancing, buffer sizing, task sequencing and scheduling.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shakib Zohrehvandi ◽  
Mohammad Khalilzadeh ◽  
Maghsoud Amiri ◽  
Shahram Shadrokh

PurposeThe aim of this research is to propose a buffer sizing and buffer controlling algorithm (BSCA) as a heuristic algorithm for calculating project buffer and feeding buffers as well as dynamic controlling of buffer consumption in different phases of a wind power plant project in order to achieve a more realistic project duration.Design/methodology/approachThe BSCA algorithm has two main phases of planning and buffer sizing and construction and buffer consumption. Project buffer and feeding buffers are determined in the planning and buffer sizing phase, and their consumption is controlled in the construction and buffer consumption phase. The heuristic algorithm was coded and run in MATLAB software. The sensitivity analysis was conducted to show the BSCA influence on project implementation. Then, to evaluate the BSCA algorithm, inputs from this project were run through several algorithms recently presented by researchers. Finally, the data of 20 projects previously accomplished by the company were applied to compare the proposed algorithm.FindingsThe results show that BSCA heuristic algorithm outperformed the other algorithms as it shortened the projects' durations. The average project completion time using the BSCA algorithm was reduced by about 15% compared to the previous average project completion time.Originality/valueThe proposed BSCA algorithm determines both the project buffer and feeding buffers and simultaneously controls their consumption in a dynamic way.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Huaifeng Shi ◽  
Chengsheng Pan ◽  
Yingzhi Wang

2020 ◽  
Vol 17 (1) ◽  
pp. 1-23
Author(s):  
Wolfgang Weiss ◽  
Víctor J. Expósito Jiménez ◽  
Herwig Zeiner
Keyword(s):  

2020 ◽  
Vol 117 ◽  
pp. 103267
Author(s):  
Shakib Zohrehvandi ◽  
Mohammad Khalilzadeh ◽  
Maghsoud Amiri ◽  
Shahram Shadrokh

Sign in / Sign up

Export Citation Format

Share Document