Flow line balancing problem: A survey
Texte intégral
Documents relatifs
Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is
In a general way, according to the performance metrics used, IBEA avg glob- ally outperforms IBEA 1 and IBEA stoch for all probability distributions (except for the first
The heuristic is based on splitting iteratively subproblems into smaller subproblems (i.e., subproblems with fewer stations and fewer tasks to be assigned) and solving
The Alternative Subgraphs Assembly Line Balancing Problem (ASALBP) is a general assembly line balancing problem that considers alternative assembly subgraphs for
Table 7 shows the number of instances with the minimum calculation time required to obtain a proved optimal solution ( Best − time ) when both models guarantee the optimal solution
In the type 2 assembly line balancing problem (ALBP-2), the objective is to minimize the cycle time given a number of workstations; i.e., to minimize the workload of the
GALBPS adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task j is assigned next to
Given a fleet of vehicles of limited capacity, a set of stations with initial and target inventory levels and a distribution network, the MVBP requires to design a set of routes