Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell

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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01524247
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 17, 2017 - 4:36:50 PM
Last modification on : Tuesday, April 24, 2018 - 4:20:01 PM
Document(s) archivé(s) le : Monday, August 21, 2017 - 12:59:30 AM

File

978-3-642-33980-6_5_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

148

Files downloads

104