OPTIMIZATION LEARNING METHOD FOR DISCRETE PROCESS CONTROL

Ewa Dudek-Dyduch, Edyta Kucharska

Abstract

The aim of the paper is to present a novel conception of the optimization method for discrete manufacturing processes control. This method uses gathering information during the search process and a sophisticated structure of local optimization task. It is a learning method of a special type. A general formal model of a vast class of discrete manufacturing processes (DMP) is given. The model is a basis for learning algorithms. To illustrate the presented ideas, the scheduling algorithm for a special NP hard problem is given.

References

  1. Dudek-Dyduch, E., 1990. Formalization and Analysis of Problems of Discrete Manufacturing Processes. Scientific bulletin of AGH Academy of Science and Tech., Automatics vol.54, (in Polish).
  2. Dudek-Dyduch E., 1992. Control of discrete event processes - branch and bound method. Proc. of IFAC/Ifors/Imacs Symposium Large Scale Systems: Theory and Applications, Chinese Association of Automation, vol.2, 573-578.
  3. Dudek-Dyduch, E., 2000. Learning based algorithm in scheduling. In Journal of Intelligent Manufacturing. vol.11, no 2, 135-143.
  4. Dudek-Dyduch, E., Dyduch, T., 1988. Scheduling some class of discrete processes. In Proc. of 12th IMACS World Congress, Paris.
  5. Dudek-Dyduch, E., Dyduch, T., 1993. 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.
  6. Dudek-Dyduch, E., Dyduch, T., 2006. Learning algorithms for scheduling using knowledge based model. In Rutkowski L.., Tadeusiewicz R. Zadech L.A., Zurada J.(ed) Artificial Intelligence and Soft Computing , Lecture Notes in Artificial Intelligence 4029. Springer.
  7. Dudek-Dyduch, E., Fuchs-Seliger, S., 1993. Approximate algorithms for some tasks in management and economy. In System, Modelling, Control. no 7, vol.1.
  8. Johnsonbaugh R., Schaefer M., 2004. Algorithms. Pearson Education International.
  9. Kolish, R., Drexel, A., 1995. Adaptive Search for Solving Hard Project Scheduling Problems. Naval Research Logistics, vol.42.
  10. Kucharska, E., 2006. Application of an algebraic-logical model for optimization of scheduling problems with retooling time depending on system state. PhD thesis (in polish).
  11. Pearl, J., 1988. Heuristics : Intelligent search strategies for computer problem solving. Addison-Wesley Comp. Menlo Park.
  12. Rajedran, C., 1994. A no wait flow shop scheduling heuristic to minimize makespan. In Journal of Operational Research Society 45. 472-478.
  13. Sprecher, A., Kolish, R., Drexel, A., 1993. Semiactive, active and not delay schedules for the resource constrained project scheduling problem. In European Journal of Operational Research 80. 94-102.
  14. Vincke, P., 1992. Multicriteria decision-aid. John Wiley & Sons.
Download


Paper Citation


in Harvard Style

Dudek-Dyduch E. and Kucharska E. (2011). OPTIMIZATION LEARNING METHOD FOR DISCRETE PROCESS CONTROL . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 24-33. DOI: 10.5220/0003532400240033


in Bibtex Style

@conference{icinco11,
author={Ewa Dudek-Dyduch and Edyta Kucharska},
title={OPTIMIZATION LEARNING METHOD FOR DISCRETE PROCESS CONTROL},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={24-33},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003532400240033},
isbn={978-989-8425-74-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - OPTIMIZATION LEARNING METHOD FOR DISCRETE PROCESS CONTROL
SN - 978-989-8425-74-4
AU - Dudek-Dyduch E.
AU - Kucharska E.
PY - 2011
SP - 24
EP - 33
DO - 10.5220/0003532400240033