Wyniki wyszukiwania - BazTech

1

Outline of a method for allocating railway shift workers accounting for the difficulty of work

Nedeliaková Eva, Valla Michal, Hranický Michal Petr, Mańkowski Cezary, Ližbetinová Lenka

Transport Problems

|

2022

|

T. 17, z. 3

211--224

EN

At present, shift work is evaluated from the carriers’ perspective as employers. Therefore, the purpose of the article is to outline the characteristics of an innovative software application that would enable human resource managers to take railway workers’ satisfaction or the difficulty of a job into account when creating shift plans. This article includes an overview of the prevailing methods of handling railway shift worker scheduling and a list and description of the empirical methods for creating shifts. Next, the consideration given to the interests and preferences of employees regarding shift types is described. We then outline possible changes, especially changes utilizing mathematical formulas. These patterns and considerations are verified through actual shifts and questionnaires distributed to a select group of employees. An actual shift of conductors at the Czech national carrier České dráhy is chosen for the case study. Finally, a proposal of a software system that takes employee preferences into account and permits the scheduling of blocks of free days is described. From the development point of view, the aim of this software is to achieve maximum satisfaction after subjective requirements are considered, thus ensuring, from the human resource management perspective, a higher degree of railway employees’ satisfaction, leading to better quality services and improved rail transport.

2

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case

Foryś W., Oprocha P.

Fundamenta Informaticae

|

2011

|

Vol. 111, nr 2

147-161

EN

We study interrelations between symbolic descriptions of concurrently evolving systems and underlying sequential dynamics. The basic framework for this research is formulated on the background of the theory of traces. We focus our interests on minimal shifts and t-shifts generated by them, that is shifts defined in the space of infinite real traces. We show that sets of infinite real traces generated by minimal shifts are always closed and, under some conditions, are also tshifts. Additional discussion for the case of small alphabets (containing at most four letters) is also provided.

3

Computability Theoretic Properties of the Entropy of Gap Shifts

Hertling P., Spandl C.

Fundamenta Informaticae

|

2008

|

Vol. 83, nr 1-2

141-157

EN

First, we analyse the computability theoretic relationship between the defining set S of a "gap shift" and the language of the gap shift. Therefore, we look at various computability theoretic conditions that the set S of a gap shift or the language of a gap shift might satisfy: decidability, computable enumerability, and computable enumerability of the complement. Then we look at the topological entropy of a gap shift and analyse the relationship between on the one hand the various kinds of computability theoretic conditions on a gap shift that we just mentioned and on the other hand various kinds of computability theoretic conditions on the entropy resp. on any real number in the unit interval: computability, left-computability, and right-computability.