An effective integer program for a general assembly line balancing problem with parallel workers and additional assignment restrictions

Abstract

The scope of the assembly line balancing problem in research is clear, with well-defined sets of assumptions, parameters, and objective functions. In application, these borders are frequently transgressed. Many of these deviations are internal to the assembly line balancing problem itself, arising from any of the physical or technological features in modern assembly lines. Other issues are founded in the tight coupling of assembly line balancing with external production planning and management problems, as assembly lines are at the intersection of multiple related problems in job sequencing, part flow logistics, worker safety, and quality. General assembly line balancing is devoted to studying the solution techniques necessary to model these applied line balancing problems.This article presents a complex line balancing problem based on the real production environment of our industrial partner, featuring several extensions for task-to-task relationships, station characteristics limiting assignment, and parallel worker zoning interactions. A heuristic, combining rank-position-weighting, last-fit-improvement and iterative blocking scheme, and an integer program that can manage multiple constraint types simultaneously, are developed. An experiment is conducted testing each of these new solution methods upon a battery of testbed problems, measuring solution quality, runtime, and achievement of feasibility. Results indicate that the integer programming model provides a viable solution method for those industries with access to commercial solvers.