Selection of the Best-Case Scenario by Considering a Trade-off between Time and Cost in the U-type Assembly Line Problem

This paper addresses a novel approach to select the best U-type assembly line problem scenario dealing with flexible task time assembly line balancing problem (FTALBP). In this regard, the operation time of each task can be between lower and upper bounds. Namely, the processing time of tasks can be compressed, but this action may lead to higher costs. This cost is described in terms of task time via a linear function. Hence, a bi-criteria integer programming model comprises two conflict objective functions: minimizing the cycle time and the total costs due to the NP-hardness of the problem. A non-dominated sorting genetic algorithm (NSGA-II) is used to solve our developed mathematical model.

کلیدواژه ها:

Assembly Line Balancing ، Trade-off ، Scenario