Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell

  • Quang-Vinh Dang
  • Izabela Nielsen
  • Kenn Steger-Jensen
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 384)

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.

Keywords

Scheduling Mobile Robot MIP Feeding Sequence 

References

  1. 1.
    Crama, Y., van de Klundert, J.: Cyclic Scheduling of Identical Parts in a Robotic Cell. Oper. Res. 45, 952–965 (1997)MATHCrossRefGoogle Scholar
  2. 2.
    Crama, Y., van de Klundert, J.: Cyclic Scheduling in 3-machine Robotic Flow Shops. J. Sched. 2, 35–54 (1999)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Crama, Y., Kats, V., van de Klundert, J., Levner, E.: Cyclic Scheduling in Robotic Flowshops. Ann. Oper. Res. 96, 97–124 (2000)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Dror, M., Stulman, A.: Optimizing Robot’s Service Movement: a One Dimensional Case. Comput. Ind. Eng. 12, 39–46 (1987)CrossRefGoogle Scholar
  5. 5.
    Kats, V., Levner, E.: Parametric Algorithms for 2-cyclic Robot Scheduling with Interval Processing Times. J. Sched. 14, 267–279 (2011)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Kats, V., Levner, E.: A Faster Algorithm for 2-cyclic Robotic Scheduling with a Fixed Robot Route and Interval Processing Times. Eur. J. Oper. Res. 209, 51–56 (2011)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Maimon, O., Braha, D., Seth, V.: A Neural Network Approach for a Robot Task Sequencing Problem. Artif. Intell. Eng. 14, 175–189 (2000)CrossRefGoogle Scholar
  8. 8.
    Suárez, R., Rosell, J.: Feeding Sequence Selection in a Manufacturing Cell with Four Parallel Machines. Robot Comput. Integrated Manuf. 21, 185–195 (2005)CrossRefGoogle Scholar
  9. 9.
    Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)MATHCrossRefGoogle Scholar
  10. 10.
    Silver, E.A., Pyke, D.F., Peterson, R.: Inventory Management and Production Planning and Scheduling. John Wiley & Sons, New York (1998)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Quang-Vinh Dang
    • 1
  • Izabela Nielsen
    • 1
  • Kenn Steger-Jensen
    • 1
  1. 1.Department of Mechanical and Manufacturing EngineeringAalborg UniversityAalborgDenmark

Personalised recommendations