Skip to main content

Research Scheduling Problem of Job-Shop Robotic Manufacturing Cell with Several Robots

  • Conference paper
Intelligent Robotics and Applications (ICIRA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8918))

Included in the following conference series:

Abstract

To solve the job-shop scheduling problem of robotic manufacturing cell with multiple robots, population initialization method and neighborhood search mechanism of its solution genetic algorithm are studied. The objective is to determine a schedule of machine and transport operations as well as assignment of robots to transport operation with minimize the maximum completion time. To improve the quality of the initial population, heuristic initialization method based on 3 vectors scheduling combining dispatching rules is proposed. Neighborhood structure is constructed based on the critical path. Experimental results show that the algorithm is effective.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dawande, M.W., Geismar, H.N., Sethi, S.P., et al.: Sequencing and scheduling in robotic cells: Recent developments. Journal of Scheduling 8(5), 387–426 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dawande, M.W., Geismar, H.N., Sethi, S.P., et al.: Throughput Optimization in Robotic Cells, pp. 1–413. Springer, Germany (2007)

    MATH  Google Scholar 

  3. Philippe, L., Mohand, L.: A Disjunctive Graph for the job-shop with several robots. In: MISTA Conference, pp. 285–292 (2007)

    Google Scholar 

  4. Bierwith, C.: A generalized permutation approach to job-shop scheduling with genetic algorithms. OR Spektrum 17, 87–92 (1995)

    Article  Google Scholar 

  5. Hurink, J., Knust, S.: A fast tabu search algorithm for the job shop problem. Management Science 42(6), 797–813 (1996)

    Article  Google Scholar 

  6. Caumond, A., Lacomme, P., Moukrim, A., Tchernev, N.: An MILP for scheduling problem in an FMS with one vehicle. European Journal of Operational Research 199(3), 706–772 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yang, Y., Long, C., Tao, Y. (2014). Research Scheduling Problem of Job-Shop Robotic Manufacturing Cell with Several Robots. In: Zhang, X., Liu, H., Chen, Z., Wang, N. (eds) Intelligent Robotics and Applications. ICIRA 2014. Lecture Notes in Computer Science(), vol 8918. Springer, Cham. https://doi.org/10.1007/978-3-319-13963-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13963-0_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13962-3

  • Online ISBN: 978-3-319-13963-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics