Skip to main content
Springer Nature Link
Log in

Learning Algorithms for Scheduling Using Knowledge Based Model

  • Conference paper
Artificial Intelligence and Soft Computing – ICAISC 2006 (ICAISC 2006)

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

Included in the following conference series:

Abstract

The aim of the paper is to present a conception of learning algorithms for discrete manufacturing processes control. A general knowledge based model of a vast class of discrete manufacturing processes (DMP) is given. The model is a basis for the method of the synthesis of intelligent, learning algorithms that use information on the process gained in previous iterations as well as an expert knowledge. To illustrate the presented ideas, the scheduling algorithm for a special NP-hard problem is given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Doherty, P.: Knowledge Representation and Unmanned Aerial Vehicles. In: Proc. of the IEEE/WIC/ACM Int. Conf. on Web Intelligence, IEEE (2005)

    Google Scholar 

  2. Dudek-Dyduch, E.: Learning based algorithm in scheduling. Journal of Intelligent Manufacturing 11(2), 135–143 (2000)

    Article  Google Scholar 

  3. Dudek-Dyduch E.: Formalization and Analysis of Problems of Discrete Manufacturing Processes. Scientific bull. of AGH Academy of Science and Tech., Automatics (in Polish), Cracow, vol. 54 (1990)

    Google Scholar 

  4. Dudek-Dyduch, E., Fuchs-Seliger, S.: Approximate algorithms for some tasks in management and economy. System, Modelling, Control 1(7) (1993)

    Google Scholar 

  5. Dudek-Dyduch, E., Dyduch, T.: Scheduling some class of discrete processes. In: Proc. of 12th IMACS World Congress, Paris (1988)

    Google Scholar 

  6. Dudek-Dyduch, E.: Control of discrete event processes - branch and bound method. In: Proc. of IFAC/Ifors/Imacs Symposium Large Scale Systems: Theory and Applications, vol. 2, pp. 573–578. Chinese Association of Automation (1992)

    Google Scholar 

  7. Dudek-Dyduch, E., Dyduch, T.: Formal approach to optimization of discrete manufacturing processes. In: Hamza, M.H. (ed.) Proc. of the Twelfth IASTED Int. Conference Modelling, Identification and Control, Acta Press, Zurich (1993)

    Google Scholar 

  8. Kolish, R., Drexel, A.: Adaptive Search for Solving Hard Project Scheduling Problems. Naval Research Logistics 42 (1995)

    Google Scholar 

  9. Liebowitz, J. (ed.): The Handbook of Applied Expert Systems. CRC Press, Boca Raton (1998)

    MATH  Google Scholar 

  10. McGuinness, D.L., Patel-Schneider, P.F.: Usability Issues in Knowledge Representation Systems. In: Proc. Of XV National Conf. on Artificial Intelligence, Madison, Wisconsin (1998)

    Google Scholar 

  11. Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley Comp., Menlo Park (1988)

    Google Scholar 

  12. Rajedran, C.: A no wait flow shop scheduling heuristic to minimize makespan. Journal of Operational Research Society 45, 472–478 (1994)

    Google Scholar 

  13. Sprecher, A., Kolish, R., Drexel, A.: Semiactive, active and not delay schedules for the resource constrained project scheduling problem. European Journal of Operational Research 80, 94–102 (1995)

    Article  MATH  Google Scholar 

  14. Tadeusiewicz, R., Dudek-Dyduch, E.: Construction of Branch & Bound Decision Tree in Optimization of Discrete Manufacturing Processes. In: Computer Science in Management, Poldex, Krakow, pp. 169–180 (1998)

    Google Scholar 

  15. Vincke, P.: Multicriteria decision-aid. John Wiley & Sons, Chichester (1992)

    Google Scholar 

  16. Zhonghao, W., Xinyu, S.,, Guojun, Z.,, Haiping, Z.: Integration of Variable Precision Rough Set and Fuzzy Clustering: An Application to Knowledge Acquisition for Manufacturing Process Planning. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3642, Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Automatics, Poland

    Ewa Dudek-Dyduch

  2. Institute of Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, PL 30-059, Krakow

    Tadeusz Dyduch

Authors
  1. Ewa Dudek-Dyduch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tadeusz Dyduch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Berkeley Initiative in Soft Computing (BISC), University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Department of Electrical Engineering, University of Louisville, 40292, Louisville, KY, U.S.A

    Jacek M. Żurada

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dudek-Dyduch, E., Dyduch, T. (2006). Learning Algorithms for Scheduling Using Knowledge Based Model. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_114

Download citation

  • DOI: https://doi.org/10.1007/11785231_114

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35748-3

  • Online ISBN: 978-3-540-35750-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics