Narzędzia help

Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
first previous next last
cannonical link button


ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes

Tytuł artykułu

A method of making up a clinic schedule with use of a finite-state automaton

Autorzy Tkachenko, R.  Kovalyshyn, O. 
Treść / Zawartość
Warianty tytułu
Języki publikacji EN
EN The article investigates the problems of scheduling methods for making up the schedules for medical care institutions, with a view to further optimization the conditions and improvement the patient care. It is noted that a key step in the operation of medical institutions is the scheduling stage process. Depending on the specifics of a particular institution, work plans take different forms, mostly turning into a timetable. It is established that there are a number of scheduling methods, ranging from manual planning and mathematical programming with limitations, ending with the use of artificial intelligence. Most methods consist of two or more stages and initially require the construction of the very schedule that satisfies the strict limitations of the institution functioning. At a later stage the scheduling optimization of one or more criteria is regarded. The types of finite-state automata are analyzed and, with their use, developed a method for constructing the supporting schedules for clinics. An algorithm of finite-state machines for clinic schedule construction is established.
Słowa kluczowe
EN clinic   schedule   schedule construction   abstract automaton   finite-state automation  
Wydawca Polish Academy of Sciences, Branch in Lublin
Czasopismo ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Rocznik 2016
Tom Vol. 5, No 3
Strony 131--134
Opis fizyczny Bibliogr. 17 poz., rys., wz.
autor Tkachenko, R.
  • National University "Lviv Polytechnic
autor Kovalyshyn, O.
1. Epifanov V.A., Epifanov A.V, 2014. Rehabilitation in neurology / V.A. Epifanov. – GEOTAR Media. – p. 416.
2. Brouwer V., 1987. Introduction to the theory of finite automata; trans.from Germ. / V. Brouwer. – M .: Radio and Communications. – 392 p.
3. Burdyuk V.Y., Shkurba V.V. Theory of schedules. Objectives and methods of solutions / V.Y. Burdyuk // Cybernetics. – 1971. – № 1. – p. 89-102.
4. Gafarov E.R., Lazarev A.A. Proof of NP-hardness particular case of the problem of minimizing the total delay for one device / E.R. Gafarov // Izvestiya AN: Theory and management systems. – 2006.- № 3. – p. 120-128.
5. Gary M. Johnson D. Computers and Intractability. Trans. from Eng. / M. Gary. – M .: Mir, 1982. – 416 p.
6. Gill A. Introduction to the theory of finite automata; trans.from Eng. / A. Gill. - M .: Nauka, 1966 – 272 p.
7. Lazarev A.A., Kvaratskhelia A.G., Gafarov E.R. Algorithms for solving NP-hard problems of minimization of summarized delay for one device / A.A. Lazarev // Reports of the Academy of Sciences. - 2007.- 412.- № 6. T. p. 739-742.
8. Karpov Y.G. Automata Theory: Textbook for Universities / Y.G. Karpov. - SPb .: Peter, 2002. - 224 p.
9. Korotkova M.A. The mathematical theory of automata: a manual for schools / M.A. Korotkova - M .: Publishing house of the Moscow Engineering Physics Institute, 2008. - 116 p.
10. Coffman E.G. The theory of schedules and computers // E.G. Coffman - M .: Nauka, 1984. - 335 p.
11. Melikhov A.N. Directed graphs and finite state machines / A.N. Melikhov. – M .: Nauka, 1971 – 416 p.
12. Sidorin A.B. Automation methods of scheduling sessions Part 2: Heuristic optimization methods /A.B. Sidorin, L.V. Likucheva, A.M. Dvoryankin // News VSTU. – Volgograd, 2009. – №12 (60). – p. 120-123.
13. Hopcroft J., Motvani R. Ullman G. Introduction to Automata Theory, Languages and Computing; trans. from Eng. / J. Hopcroft. – M .: "Williams", 2002. - 527 p.
14. Shkurba V.V., Podchasova T.P., Pshichuk A.N. Tur L.P. Tasks of scheduling and methods of their solution / V.V. Shkuba.- Naukova Dumka, 1966.- 154 p.
15. Baptiste Ph., Le Pape C., Nuijten W. Constraint-based scheduling: applying constraint programming to scheduling problems / Ph. Baptiste// Kluwer Academic Publishers, 2001.– 198 p.
16. Brooks G.N., White C.R. An algorithm for finding optimal or near – optimal solutions to the production scheduling problem / G.N. Brooks// J. Ind. Eng.– 1965.– V. 16, N 1.– P. 34 – 40.
17. Caroll J., Long D. (1989), Theory of Finite Automata.
Kolekcja BazTech
Identyfikator YADDA bwmeta1.element.baztech-cba21582-835f-43c9-a9cb-4fc412d960f7