Skip to main content

Hierarchical Task Model for Resource Failure Recovery in Production Scheduling

  • Conference paper
  • First Online:
Book cover Advances in Computational Intelligence (MICAI 2016)

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

Included in the following conference series:

Abstract

Attaining optimal results in real-life scheduling is hindered by a number of problems. One such problem is dynamics of manufacturing environments with breaking-down resources and hot orders coming during the schedule execution. A traditional approach to react to unexpected events occurring on the shop floor is generating a new schedule from scratch. Complete rescheduling, however, may require excessive computation time. Moreover, the recovered schedule may deviate a lot from the ongoing schedule. Some works have focused on tackling these shortcomings, but none of the existing approaches tries to substitute jobs that cannot be executed with a set of alternative jobs. This paper describes the scheduling model suitable for dealing with unforeseen events using the possibility of alternative processes and proposes an efficient heuristic-based approach to recover an ongoing schedule from a resource failure.

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 EPUB and 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

References

  1. Abumaizar, R.J., Svestka, J.A.: Rescheduling job shops under random disruptions. Int. J. Prod. Res. 35(7), 2065–2082 (1997)

    Article  MATH  Google Scholar 

  2. Barták, R., Čepek, O.: Nested temporal networks with alternatives. In: AAAI Workshop on Spatial and Temporal Reasoning, Technical Report WS-07-12, pp. 1–8. AAAI Press (2007)

    Google Scholar 

  3. Barták, R., Muller, T., Rudová, H.: Minimal perturbation problem-a formal view. Neural Netw. World 13(5), 501–512 (2003)

    Google Scholar 

  4. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1), 61–95 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dulai, T., Werner-Stark, Á.: A database-oriented workflow scheduler with historical data and resource substitution possibilities. In: Proceedings of the International Conference on Operations Research and Enterprise Systems, pp. 325–330. SciTePress (2015)

    Google Scholar 

  6. Kondrak, G., Van Beek, P.: A theoretical evaluation of selected backtracking algorithms. Artif. Intell. 89(1), 365–387 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: Shop2: an HTN planning system. J. Artif. Intell. Res. (JAIR) 20, 379–404 (2003)

    MATH  Google Scholar 

  8. Oddi, A., Policella, N., Cesta, A., Smith, S.F.: Boosting the performance of iterative flattening search. In: Basili, R., Pazienza, M.T. (eds.) AI*IA 2007. LNCS, vol. 4733, pp. 447–458. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74782-6_39

    Chapter  Google Scholar 

  9. Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. J. Schedul. 12(4), 417–431 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Planken, L.R.: New algorithms for the simple temporal problem. Ph.D. thesis, TU Delft, Delft University of Technology (2008)

    Google Scholar 

  11. Raheja, A.S., Subramaniam, V.: Reactive recovery of job shop schedules - a review. Int. J. Adv. Manuf. Technol. 19, 756–763 (2002)

    Article  Google Scholar 

  12. Skalický, T.: Interactive Scheduling and Visualisation. Master’s thesis, Charles University in Prague (2011)

    Google Scholar 

  13. Smith, S.F.: Reactive scheduling systems. In: Brown, D., Scherer, W. (eds.) Intelligent scheduling systems, pp. 155–192. Springer US, Boston (1995)

    Chapter  Google Scholar 

  14. Vieira, G., Herrmann, J., Lin, E.: Rescheduling manufacturing systems: a frame-work of strategies, policies, and methods. J. Schedul. 6, 39–62 (2003)

    Article  MATH  Google Scholar 

Download references

Acknowledgments

This research is partially supported by the Charles University in Prague, project GA UK No. 158216, by SVV project number 260 333, and by the Czech Science Foundation under the project P103-15-19877S.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marek Vlk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Barták, R., Vlk, M. (2017). Hierarchical Task Model for Resource Failure Recovery in Production Scheduling. In: Sidorov, G., Herrera-Alcántara, O. (eds) Advances in Computational Intelligence. MICAI 2016. Lecture Notes in Computer Science(), vol 10061. Springer, Cham. https://doi.org/10.1007/978-3-319-62434-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62434-1_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62433-4

  • Online ISBN: 978-3-319-62434-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics