PurposeDue to the market trend of low-volume and high-variety, the manufacturing industry is paying close attention to improve the ability to hedge against variability. Therefore, in this paper the assembly line with limited resources is balanced in a robust way that has good performance under all possible scenarios. The proposed model allows decision makers to minimize a posteriori regret of the selected choice and hedge against the high cost caused by variability.Design/methodology/approachA generalized resource-constrained assembly line balancing problem (GRCALBP) with an interval data of task times is modeled and the objective is to find an assignment of tasks and resources to the workstations such that the maximum regret among all the possible scenarios is minimized. To properly solve the problem, the regret evaluation, an exact solution method and an enhanced meta-heuristic algorithm, Whale Optimization Algorithm, are proposed and analyzed. A problem-specific coding scheme and search mechanisms are incorporated.FindingsTheory analysis and computational experiments are conducted to evaluated the proposed methods and their superiority. Satisfactory results show that the constraint generation technique-based exact method can efficiently solve instances of moderate size to optimality, and the performance of WOA is enhanced due to the modified searching strategy.Originality/valueFor the first time a minmax regret model is considered in a resource-constrained assembly line balancing problem. The traditional Whale Optimization Algorithm is modified to overcome the inferior capability and applied in discrete and constrained assembly line balancing problems.
Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem
