Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell

(1) , (1) , (1)
1

Abstract

This paper deals with the problem of finding optimal feeding sequence in a manufacturing cell with feeders fed by a mobile robot with manipulation arm. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. Besides, the robot has to be scheduled in order to keep production lines within the cell working without any shortage of parts fed from feeders. A mixed-integer programming (MIP) model is developed to find the optimal solution for the problem. In the MIP formulation, a method based on the (s, Q) inventory system is applied to define time windows for multiple-part feeding tasks. A case study is implemented at an impeller production line in a factory to demonstrate the result of the proposed MIP model.
Fichier principal
Vignette du fichier
978-3-642-33980-6_5_Chapter.pdf (581.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524247 , version 1 (17-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Quang-Vinh Dang, Izabela Nielsen, Kenn Steger-Jensen. Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell. International Conference on Advances in Production Management Systems (APMS), Sep 2011, Stavanger, Norway. pp.37-44, ⟨10.1007/978-3-642-33980-6_5⟩. ⟨hal-01524247⟩
117 View
208 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More