PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

CP approach to design of steady-state flow of repetitive manufacturing processes in SME

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Concurrent execution of work orders in the small and medium size enterprises (SME) imposes a necessity to consider many control problems concerning systems of repetitive concurrent manufacturing processes using common resources in mutual exclusion. In many cases a production system with a given structure of the processes resource requests can be seen as composed of subsystems with n cyclic processes sharing one resource. For given sets of possible values of the processes operation execution times a problem of finding schedules guaranteeing that no process waits for access to the common resources is considered. In particular for the assigned times of the operations execution a subproblem of finding all possible starting times of work orders execution for which waiting-free schedules exist has been formulated as a constraint programming (CP) problem. The starting times derived can be used as an alternative starting times of work orders execution in case of their possible delays. A state space of the problem’s solutions has been reduced using constraints based on the necessary and sufficient conditions for existence of a waiting-free n-process steady-state schedule. An illustrative example of Mozart-based software application to the solution of constraint logic programming problem considered has been presented.
Rocznik
Strony
201--218
Opis fizyczny
Bibliogr. 17 poz., fig.
Twórcy
autor
  • Wrocław University of Technology, Institute of Informatics, Automatics and Robotics, 50-372 Wrocław, Poland
autor
  • Technical University of Koszalin, Department of Electronics and Informatics, 75-453 Koszalin, Poland
Bibliografia
  • [1] ALPAN G., JAFARI M. A.: Dynamic Analysis of Timed Petri Nets: a Case of Two Processes and a Shared Resource. IEEE Trans. on Robotics and Automation, Vol.13, No. 3, 1997, pp. 338-346.
  • [2] ALPAN G., JAFARI M. A.: Synthesis of Sequential Controller in the Presence of Conflicts and Free Choices. IEEE Trans. on Robotics and Automation, Vol.14, No. 3, 1998, pp. 488-492.
  • [3] BANASZAK Z., KROGH B.: Deadlock Avoidance in Flexible Manufacturing Systems with Concurrently Competing Process Flows. IEEE Trans. on Robotics and Automation, Vol. 6, No. 6, 1990, pp. 724-734.
  • [4] BENHAMOU F.: Interval constraint logic programming. Ed. Podelski A., Constraints: Basics and Trends, Lecture Notes in Computer Science, Vol. 910, Springer-Verlag, Berlin, Heidelberg, 1995, pp. 1-21.
  • [5] COHEN H.: A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, Heidelberg, 1993.
  • [6] POLAK M., MAJDZIK P., BANASZAK Z., WÓJCIK R.: The Performance Evaluation Tool for Automated Prototyping of Concurrent Cyclic Processes. Fundamenta Informaticae, Vol. 60, No.1-4, April 2004, pp. 269-289.
  • [7] SARASWAT V.: Concurrent Constraint Programming. MIT Press, 1994.
  • [8] SCHRODER M. R.: Number Theory in Science and Communications. 3rd edition, Springer-Verlag, Berlin, Heidelberg, 1997.
  • [9] WÓJCIK R.: Metody dynamicznej alokacji zasobów w zadaniach sterowania ESP. Zeszyty Naukowe Politechniki Śląskiej, seria Automatyka, z.109, Gliwice, 1992, pp. 321-332.
  • [10] WÓJCIK R.: Performance evaluation of repetitive manufacturing processes using state vectors approach. Computer Integrated Manufacturing, Advanced Design and Management, Eds. Skołud B., Krenczyk D., WNT, Warszawa, 2003, pp. 612-619.
  • [11] WÓJCIK R.: Towards Strong Stability of Concurrent Repetitive Processes Sharing Resources. Systems Science, Vol. 27, No. 2, 2001, pp. 37-47.
  • [12] BANASZAK Z., JÓZEFOWSKA J. (red.): Project-driven manufacturing. WNT, Warszawa, 2003.
  • [13] BANASZAK Z., TOMCZUK I.: Harmonogramowanie przedsięwzięć z wykorzystaniem technik programowania z ograniczeniami. Red. Knosala R., Komputerowo Zintegrowane Zarządzanie, WNT, Warszawa, 2004, pp. 38-47.
  • [14] ROSSI F.: Constraint (Logic) programming: A Survey on Research and Applications. K.R. Apt et al. (Eds.), New Trends in Constraints, LNAI 1865, Springer-Verlag, Berlin, 2000, pp. 40-74.
  • [15] TOMCZUK I., BANASZAK Z.: Production flow planning based on CLP approach. ed. Knosala R., Computer Integrated Management, WNT, Warszawa, 2005, pp. 589-600.
  • [16] VAN HENTENRYCK, P.: Constraint Logic Programming. Knowledge Engineering Review, Vol. 6, 1991, pp. 151–194.
  • [17] WALLACE M.: Constraint Logic Programming. Ed. Kakas A.C., Sadri F., Computat. Logic, LNAI 2407, Springer-Verlag, Berlin, Heidelberg, 2000, pp. 512-532.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-a8b9f55a-d269-415b-b484-2970201be3eb
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.