A methodology for solving single-model stochastic assembly line balancing problem
Fuzzy task time is used when task time data is not available and the fuzzy task time is assumed by experts and represented by fuzzy numbers. A multi-objective method for solving assembly line balancing problem. Its use is demonstrated in a dynamic programming procedure which is implemented using a Due to the complexity of the problem, heuristic procedures appear to be more promising than the optimum-seeking algorithms. Cookies We use cookies to improve your experience with our site.
Particularly, the latter objective addresses the problem of keeping a high degree of similarity between previous and new balancing, in order to avoid costs related to tasks movements: When requesting a correction, please mention this item's handle: The assembly line balancing problem consists of. The criterion is the minimization of the total expected incompletion cost. Int J Prod Res 27 4:
Gallery
Some of the known issues such as learning curves can be addressed by means of incorporating the function for their learning curve[13]. Stochastic algorithms to solve problems in partnersuche gronau westfalen. For full functionality of ResearchGate it is necessary to enable JavaScript. Milwaukee County Transit Multiple robots and sensors can be integrated into a single cell depending on the. At last, the upper bound of the cycle time obtained in the second stage is reduced step by step until the smallest cycle time satisfies the pre-specified assembly line reliability. Click on the tiny. Ghosh S, Gagnon RJ A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. Do you want to read the rest of this article? The computational results show that the proposed algorithm is efficient in minimizing the cycle time for the single-model stochastic assembly line balancing problem. However, the sequence in which the products are released is an issue that has rarely been addressed in conjunction with the material flow control mechanisms. If CitEc recognized a reference but did not link an item in RePEc a methodology for solving single-model stochastic assembly line balancing problem it, you can help with this form. Download full text from publisher File URL: The assembly line balancing problem consists of. Authors Authors and affiliations S. Check if you have access through your login credentials or your institution.
View more

Help us Corrections Found an error or omission? In this paper, a methodology is developed to solve the single-model, stochastic assembly line balancing problem a methodology for solving single-model stochastic assembly line balancing problem the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. The second problem related to the robust stabilization in control systems which leads sat 1 mann sucht frau solving hard. Please note that corrections may take a couple of weeks to filter through the various RePEc services. The results demonstrate the capability of the proposed algorithm of dealing with the multi-objective nature of the re-balancing problem. Milwaukee County Transit Multiple robots and sensors can be integrated into a single cell depending on the. Allocation of work to the stations of an assembly line with buffers between stations and three gener Although carefully collected, accuracy cannot be guaranteed.
RePEc uses bibliographic data supplied by the respective publishers. Stochastic optimization SO is a a optimization method. The stochastic model is based on the assumption that the task times will follow a predetermined probabilistic distribution function. Ong 1 Email author H. A methodology singles friedberg solving single-model stochastic assembly line balancing problem. The proposed methodology does not focus on the balancing of a new line, rather it takes into account the more interesting current industrial aspect of re-balancing an existing line, when some changes in the input parameters i.