Abstract
A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets
Highlights
An assembly line is a sequential order of workstations linked to each other via a conveyor or moving belt
This paper addressed to the model two-sided assembly line balancing problem (MTALBP) considering incompatible task set (ITS) constraints and reported the first research results
Three important performance criteria have been considered in the solution method, i.e. cycle time, the number of mated stations/workstations, and smoothness index
Summary
An assembly line is a sequential order of workstations linked to each other via a conveyor or moving belt. This research differs from the studies existing in the literature by presenting the first computational test results for mixedmodel two-sided assembly line balancing incorporating incompatible task sets. MTALBP is to find the best assignment configuration of tasks in mixed-model two-sided lines in such a way that one or more performance criterion is optimised. This is called sequence-dependent idle time and sometimes unavoidable due to problem specific constraints Incompatible tasks are those tasks which cannot be performed concurrently in the same mated station (workstations located on left and right sides and facing each other). WLE of a solution is calculated dividing the sum of the task times multiplied by proportional demands to the multiplication of cycle time and the number of workstations as follows: Start and initialise all sets/parameters (C ← Clow, Cbest ← B, WLE∗ ← 0, ST∗ ← B, SI∗ ← B). This is because no comparable result was published in the literature when incompatible task set constraints have been considered
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Pamukkale University Journal of Engineering Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
