Tekijä:Kim, H.
Park, S.
Otsikko:A strong cutting plane algorithm for the robotic assembly line balancing problem (NC-Maschinen, mathematisches Modell, Maschinenbelegungsplanung)
Lehti:International Journal of Production Research
1995 : AUG, VOL. 33:8, p. 2311-2323
Asiasana:
Kieli:eng
Tiivistelmä:This paper considers the problem of assigning assembly tasks, parts and tools on a serial robotic assembly line so that the total number of robot cells required is minimized while satisfying the various constraints. In this problem , we need to consider the limited space to store the parts and the tool capacity of the robot hand. The authors propose an integer programming formulation of this problem and a strong cutting plane algorithm to solve it. Computational experiences are reported.
SCIMA tietueen numero: 144463
lisää koriin
SCIMA