This article presents a novel alternative subgraphs assembly line balancing problem with resource selection and parallel stations. The model considers both the choice between different process alternatives of production resources for various tasks. It also allows parallelization stations in balanced line, thereby improving flexibility algorithm. objective optimization is to minimize total cost ...

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority ...

In this paper, we studied the assembly line worker assignment and balancing problem, which is an extension of the classical assembly line balancing problem in which an optimal partition of the assembly work among the stations is sought along with the assignment of the operators to the stations. The relationship between this problem and several other well-studied problems is explored, and new lo...

Although the simple assembly line balancing problem (SALBP) is the topic of many studies, typically they either consider minimizing the number of stations for a given cycle time (called type one), or minimizing the cycle time for a given number of stations (called type two). Rarely, type E of the problem has been considered. In the type E, cycle time and number of stations are both decision var...

Purpose: Time and Space assembly line balancing problem (TSALBP) is the of taking area required by task to store tools into consideration. This important be considered minimize unplanned traveling distance workers consequently time waste. Although TSALBP a realistic that express real-life situation, it became more practical consider multi-manned get better space utilization, few literatures add...

This paper describes a top-down method for an automatic precedence graph construction that can cope with high variant products. The concept generates a joint precedence graph including all variants of a product directly. The graph is automatically derived from the bill of materials and buildability rules as well as existing solutions for the assignment of tasks to workstations. The presented me...