Workforce minimization for a mixed-model assembly line in the automotive industry

摘要: A paced assembly line consisting of several workstations is considered. This intended to assemble products different types. The sequence given. technological tasks common for all types products. assignment the stations and task on each station are known cannot be modified, they do not depend product type. Tasks assigned same performed sequentially. processing time a depends number workers performing this task. Workers identical versatile. If worker task, he/she works from its start till completion. can switch between at end needed by any move one another neglected. At design stage, it necessary know how many line. To response question we will consider possible takt assign so that total minimized, provided given satisfied. maximum minimal numbers takts considered as Thus, problem takt. We prove NP-hard in strong sense, develop an integer linear programming formulation solve it, propose conventional randomized heuristics.