No / Organizational justice is an important determinant of workplace attitudes, decisions, and behaviors. However,understanding workplace fairness requires not only examining what happens but also when it happens, interms of justice events, perceptions, and reactions. We organize and discuss findings from 194 justice articleswith temporal aspects, selected from over a thousand empirical justice articles. By examining temporalaspects, our findings enrich and sometimes challenge the answers to three key questions in the organizationaljustice literature relating to (i) when individuals pay attention to fairness, including specific facets, (ii) howfairness judgments form and evolve, and (iii) how reactions to perceived (in)justice unfold. Our review iden-tifies promising avenues for empirical work and emphasizes the importance of developing temporal theoriesof justice. / Portuguese Foundation for Science and Technology-FCT. Grant Numbers: PTDC/EGE-GES/098856/2008, EXPL/IIM-GES/0962/2013

The High Performance Computing community is constantly facing new challenges due to the ever growing demand for processing power from scientific applications that represent diverse areas of human knowledge. Parallel and distributed systems are the key to speed up the execution of these applications as many jobs can be executed concurrently. These systems are shared by many users who submit their jobs over time and expect a fair treatment by the scheduler. The work done in this thesis lies in this context: to analyze and develop fair and efficient algorithms for managing computing resources shared among multiple users. We analyze scenarios with many submissions issued from multiple users over time. These submissions contain several jobs and the set of submissions are organized in successive campaigns. In what we define as the Campaign Scheduling model, the jobs of a campaign do not start until all the jobs from the previous campaign are completed. Each user is interested in minimizing the flow times of their own campaigns. This is motivated by the user submission behavior whereas the execution of a new campaign can be tuned by the results of the previous campaign. In the first part of this work, we define a theoretical model for Campaign Scheduling under restrictive assumptions and we show that, in the general case, it is NP-hard. For the single-user case, we show that an approximation scheduling algorithm for the (classic) parallel job scheduling problem also delivers the same approximation ratio for the Campaign Scheduling problem. For the general case with multiple users, we establish a fairness criteria inspired by time sharing. Then, we propose a scheduling algorithm called FairCamp which uses campaign deadlines to achieve fairness among users between consecutive campaigns. The second part of this work explores a more relaxed and realistic Campaign Scheduling model, provided with dynamic features. To handle this setting, we propose a new algorithm called OStrich whose principle is to maintain a virtual time-sharing schedule in which the same amount of processors is assigned to each user. The completion times in the virtual schedule determine the execution order on the physical processors. Then, the campaigns are interleaved in a fair way. For independent sequential jobs, we show that OStrich guarantees the stretch of a campaign to be proportional to campaigns size and to the total number of users. The stretch is used for measuring by what factor a workload is slowed down relatively to the time it takes to be executed on an unloaded system. Finally, the third part of this work extends the capabilities of OStrich to handle parallel jobs. This new version executes campaigns using a greedy approach and uses an event-based resizing mechanism to shape the virtual time-sharing schedule according to the system utilization ratio. / La communauté de Calcul Haute Performance est constamment confrontée à de nouveaux défis en raison de la demande toujours croissante de la puissance de traitement provenant dapplications scientifiques diverses. Les systèmes parallèles et distribués sont la clé pour accélérer lexécution de ces applications, et atteindre les défis associés car de nombreux processus peuvent être exécutés simultanément. Ces systèmes sont partagés par de nombreux utilisateurs qui soumettent des tâches sur de longues périodes au fil du temps et qui attendent un traitement équitable par lordonnanceur. Le travail effectué dans cette thèse se situe dans ce contexte: analyser et développer des algorithmes équitables et efficaces pour la gestion des ressources informatiques partagés entre plusieurs utilisateurs. Nous analysons les scénarios avec de nombreux soumissions issues de plusieurs utilisateurs. Ces soumissions contiennent un ou plusieurs processus et lensemble des soumissions sont organisées dans des campagnes successives. Dans ce que nous appelons le modèle dordonnancement des campagnes les processus dune campagne ne commencent pas avant que tous les processus de la campagne précédente soient terminés. Chaque utilisateur est intéressé à minimiser la somme des temps dexécution de ses campagnes. Cela est motivé par le comportement de lutilisateur tandis que lexécution dune campagne peut être réglé par les résultats de la campagne précédente. Dans la première partie de ce travail, nous définissons un modèle théorique pour lordonnancement des campagnes sous des hypothèses restrictives et nous montrons que, dans le cas général, il est NP-difficile. Pour le cas mono-utilisateur, nous montrons que lalgorithme dapproximation pour le problème (classique) dordonnancement de processus parallèles fournit également le même rapport dapproximation pour lordonnancement des campagnes. Pour le cas général avec plusieurs utilisateurs, nous établissons un critère déquité inspiré par une situation idéalisée de partage des ressources. Ensuite, nous proposons un algorithme dordonnancement appelé FairCamp qui impose des dates limite pour les campagnes pour assurer léquité entre les utilisateurs entre les campagnes successives. La deuxième partie de ce travail explore un modèle dordonnancement de campagnes plus relâché et réaliste, avec des caractéristiques dynamiques. Pour gérer ce cadre, nous proposons un nouveau algorithme appelé OStrich dont le principe est de maintenir un ordonnancement partagé virtuel dans lequel le même nombre de processeurs est assigné à chaque utilisateur. Les temps dachèvement dans lordonnancement virtuel déterminent lordre dexécution sur le processeurs physiques. Ensuite, les campagnes sont entrelacées de manière équitable. Pour des travaux indépendants séquentiels, nous montrons que OStrich garantit le stretch dune campagne en étant proportionnel à la taille de la campagne et le nombre total dutilisateurs. Le stretch est utilisé pour mesurer le ralentissement par rapport au temps quil prendrait dans un système dédié. Enfin, la troisième partie de ce travail étend les capacités dOStrich pour gérer des tâches parallèles rigides. Cette nouvelle version exécute les campagnes utilisant une approche gourmande et se sert aussi dun mécanisme de redimensionnement basé sur les événements pour mettre à jour lordonnancement virtuel selon le ratio dutilisation du système.

none

The element of fairness in a performance appraisal system is essential for an organisation. If the system of an organisation is not fair, it may result in an employee being dissatisfied with the appraisal system and this may lead to extremes such as employee attrition. The purpose of the study was to examine educators’ perspectives of fair performance appraisal practices in selected independent schools in Gauteng Province, South Africa. The research approach adopted for the study was qualitative while the research design used was case study. Purposive sampling technique was used in the selection of the sample for this study. The findings of the study revealed that teachers think performance appraisal was conducted properly and the process helps to improve individual teaching output. The HODs believed performance appraisal was conducted in a positive and encouraging manner. The school principals also viewed the appraisal process positively, indicating that the competence of teachers and the quality of teaching and learning taking place in the school are assessed by doing performance appraisals. The different categories of the participants namely, teachers, HODs and principals believed that the process of performance appraisal was quite fair and recommended that there should be other tools for assessing the teachers’ ability. Furthermore, the teachers did not see the appraisal system as unfair, but proposed other effective ways of conducting the appraisal system. According to the HODs, the process is time-consuming and the principals were satisfied with the appraisal process but cautioned that the process would become unfair if bonuses are given to the teachers. In addition, the teachers submitted that the exercise can be unfair if assessment is based on incorrect or inaccurate information. A fair appraisal process is when all parties are open and communicate with one another, constructive and honest feedback is given as well as the use of agreed upon procedures consistently. In conclusion, to improve the effectiveness of performance appraisal practices, fair performance appraisal practices should be given utmost priority. / Dissertation (MEd)--University of Pretoria, 2017. / Education Management and Policy Studies / MEd / Unrestricted

No description available.

No description available.

In wired network, there are many researches about scheduling algorithm. As for wireless network, the scheduling algorithm is not maturer than wired network. And there are some following characteristics of wireless network that we can not make use of wired scheduling algorithm directly:(1)Less bandwidth in wireless network;(2)Location dependent errors;(3)Higher error rate and bursty error. So when we design the wireless scheduling algorithm, there are some important issues we should take into account¡G (1)Fairness ; (2)QOS ; (3)Whether the overall throughput rises or not; (4)Whether the bandwidth is best utilized or not In this paper, we introduce the wired and wireless scheduling algorithm separately and discuss the advantage and disadvantage of these methods first. And we propose a scheduling algorithm which is based on WFQ [1] and dynamically adjusts weights according to the error rate of each flow. In this method, the base station will allocate the bandwidth by calculating the weight of mobile hosts and the proportion of error rates to the whole body. And during the process of adjusting, we will prevent the weight of a certain channel from increasing or decreasing excessively which might lead to unfair phenomenon. Under this adjustment, we will raise the whole throughput and maintain the fairness of all users.

Zugl.: Vallendar, WHU - Otto Beisheim School of Management, Diss., 2009

Thesis (Ph.D.)--University of Virginia, 1997. / Includes bibliographical references (leaves 221-233).

Mannheim, Univ., Diss., 2006.