Tardiness Research Articles

Impact of Job Embeddednes on Reducing Trdiness and Absentiseem

This study presents the findings of a primary data collection effort through a survey questionnaire aimed at investigating the relationship between job embeddedness (JE), tardiness (TAR), and absenteeism (ABS) among academic staff at KUST. The survey included demographic information in its first section, covering the characteristics of the respondents. The independent variable, job embeddedness, was assessed through seven questions in the third section, while tardiness and absenteeism were examined through three and two questions, respectively. Analysis of the questionnaire data revealed several noteworthy conclusions. The academic staff at KUST demonstrated a high level of job embeddedness, coupled with low levels of tardiness and absenteeism, suggesting a positive and robust connection with the organization. Notably, job embeddedness has been a relatively understudied topic in existing literature, making this research a valuable contribution to understanding its implications. The study underscores the importance of job embeddedness in meeting employees' demands and serving as a strategic retention strategy. It is suggested that KUST's ability to minimize negative outcomes among employees, such as tardiness and absenteeism, relies on fostering job embeddedness. The research establishes job embeddedness as a pivotal factor influencing employees' intention to arrive at work promptly and avoid absenteeism. Furthermore, the results indicate a negative and significant correlation between job embeddedness and both tardiness and absenteeism. The study recommends that KUST should prioritize attention to job embeddedness as a key factor in achieving organizational success. The negative and significant effect of job embeddedness on tardiness and absenteeism reinforces the importance of cultivating a workplace environment that promotes employees' attachment to their roles.

Help Stop Tardiness

Help Stop Tardiness

Are the standard AP and lateral views enough to detect the rotational malalignment intraoperatively during CRPP of Gartland III pediatric supracondylar humerus fractures

Background: Displaced pediatric supracondylar humerus fractures (SCHF) can lead to residual deformity if not accurately reduced and stabilized. Most publications concerning SCHF reduction have focused on malalignment in the coronal and sagittal plane without considering the rotational malalignment. However, malrotation has been identified in 60% of patients with cubitus varus deformity following a SCHF. In addition, tardy ulnar nerve palsy has been correlated with the degree of internal rotation deformity in these patients. Intraoperatively, inability to restore anatomic rotation can narrow the corridor for intraosseous pinning and make it difficult to obtain a stable …

Diminishing the Earliness and Tardiness of AGV using PSBCSP Algorithm

Diminishing the Earliness and Tardiness of AGV using PSBCSP Algorithm

An Optimization Model for Heterogeneous Vehicle Routing and Scheduling Problem with Fixed Cost and Green Reverse Logistics Network Using Genetic Algorithm

Vehicle routing problem aims to find the optimal routes that must be traveled by a fleet of vehicles to satisfy the demand of the customers. In this research, the vehicle routing and scheduling problem is developed for a heterogeneous fleet with the fixed cost of applying vehicles and earliness and tardiness costs in a green reverse logistics network. Since the complexity order of these problems is higher than that of the polynomial ones, this problem is known as NP-hard. As the problem dimensions increase, the exact solving time of the problem increases considerably. Thus, metaheuristic methods are proposed to approximately solve these problems. After developing mixed integer nonlinear model, the Genetic Algorithm (GA) is used to find the near-optimal solutions for the large-scale cases. Finally, the performance of the GA is investigated for several examples by comparing its computation time and solution quality with the computation time and exact solution of the LINGO software. According to the results, the developed GA has an acceptable performance in providing solutions with minimum error in a rational time.

Effect of clinical rehabilitation nursing pathway on patients with cerebral apoplexy in the convalescent period

Objective To explore the clinical therapeutic value of clinical rehabilitation pathway in patients with cerebral apoplexy with delayed paralysis in convalescent period. Methods From June 2015 to March 2017, 60 patients with cerebral apoplexy in the convalescent period of tardy paralysis were selected as the study subjects. According to the randomized grouping method, it is divided into the conventional nursing group (Group A) and the rehabilitation nursing path group (Group B), 30 cases of each group.Group A was given routine care, while Group B was given path care of rehabilitation care on the basis of routine care.All patients were evaluated before discharge 〔hospitalization time, hospitalization expenses, master knowledge of rehabilitation, nursing satisfaction, Fug1-Meyer score, ADL score index (ADL) -Barthel〕. Results After treatment, the hospitalization time and hospitalization expenses of Group B were significantly lower than those of Group A. The indicators of patients' knowledge of rehabilitation, nursing satisfaction, Fug1-Meyer table score and ADL-Barthel index score of Group B were significantly higher than those of Group A. The differences were statistically significant(P<0.05or P<0.000). Conclusions Clinical nursing path recovery slow stroke palsy patients, which can effectively shorten in-hospital time, save the patients' hospitalization expenses, improve patient rehabilitation knowledge awareness, improve nursing satisfaction, improve patients exercise capacity and daily life ability, improve the treatment effect.The path of clinical rehabilitation nursing is standardized, effective, feasible and credible.It is worth promoting in clinic. Key words: Stroke; Stroke with flaccid paralysis; Nursing pathway; ADL; Fug1-Meyer

Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints

Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints

Persuasive farce. Dialogical pragmatics in the novels of P.G. Wodehouse

Abstract – This paper explores persuasion, as a speech act, in the novels of the English comic writer P.G. Wodehouse. Persuasion, as a topic for enquiry within linguistics, has been extensively studied, in a variety of social contexts (e.g. Sandell 1977; Jowett and O’Donnell 1992; Messaris 1997; Nash 1989; Hyland 1998; Halmari and Virtanen 2005; Charteris-Black 2006; Tardy 2011). All these studies are either general accounts of persuasion, or else describe its presence as a pragmatic focus in a specific social context, invoking diverse (pragma)-linguistic features to explain its operation. What seems, as yet, relatively under-explored, is its operation in everyday conversational interaction, and this paper represents a move in this direction, though the distinction between authentic and literary data is recognised. It uses an analytical methodology based on Speech Act Theory (Austin 1962; Searle 1969) and Dialogical Pragmatics (Kecskes 2016) to explore instances in the novels in which Bertie Wooster, Wodehouse’s principal character, is persuaded to do various things. What emerges, although not a picture of authentic verbal persuasion as it would occur in actual interaction, but a facsimile that may shed light on some of the discursive processes involved. It is suggested, in fact that, at the level of pragmatics, the processes involved in authentic and literary speech acts are not as different as they are sometimes taken to be.

Minimizing the Total Completion Time and Maximum Tardiness on a Scheduling with a Learning Effect

Bu calismada tek makineli cizelgelemede ogrenme etkisi analiz edilmis, performans olcutu olarak da toplam tamamlanma zamani ve maksimum gecikme alinmistir. Calismada problemin klasik (ogrenme etkisiz) durumda en iyi cozumu garanti eden Smith Algoritmasi [1] (maksimum gecikmeyi minimize etme kisiti altinda toplam tamamlanma zamanini minimize etme) ve Van Vassenhove ve Gelder algoritmasinin [2] (toplam tamamlanma zamani ve maksimum gecikmeyi ayni anda minimize etme) ogrenme etkili durumda optimal cozumu garanti etmedigi gosterilmistir. Problemleri cozmek icin matematiksel programlama modelleri gelistirilmistir.

Scheduling with Multiple Common Due Windows Assignment and General Position-Dependent and Resource-Dependent Processing Times

In this paper we consider multiple common due windows assignment and single-machine scheduling problems with general position-dependent and resource-dependent processing times simultaneously. Multiple common due windows, an extension of single common due window, allow a job to fit one from multiple common due windows. We assume that the number of common due windows to be assigned to the jobs is given. Two resource allocation models are examined, namely the linear resource consumption model and the convex re-source consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. We aim to determine jointly the optimal common due window positions and sizes, the set of jobs assigned to each common due window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due windows assignment, makespan, and resource consumption costs. We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered.

Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem

This paper focuses on solving the bi-objective problem of no-wait two-stage flexible flow shop scheduling. The objectives considered in this study are minimum makespan (Cmax), as well as maximum tardiness of jobs (Tmax). This problem is known as NP-hard. Hence, three bi-objective optimization methods based on simulated annealing, called CWSA (classical weighted simulated annealing), NWSA (normalized weighted simulated annealing), and FSA (fuzzy simulated annealing), are developed to solve the problem with the goal of finding approximations of the optimal Pareto front. Due to the fact that meta-heuristic algorithms are very vigilant of parameter values, we proposed a new reliable method, by mixing the Taguchi method and a Multi-Objective Decision Making (MODM) approach, for achieving our purpose. The algorithms are evaluated by solving both small and large scale problems. The performances are evaluated in terms of a relative deviation index. Finally, the result of the study is discussed and concluded, and potential areas of further study are highlighted.

An uncommon cause of tardy ulnar nerve palsy due to upper extremity prolonged malposition in a comatose child: a case report

Background and Objective: Ulnar nerve neuropathy is one of the most common peripheral nerve dysfunctions. Elbow is the most common area affected by ulnar nerve which is mainly because of fractures or dislocations of this area. Delayed ulnar nerve palsy (Tardy Ulnar Nerve Palsy) in children due to a malpositioning of upper extremity during hospitalization is an uncommon cause of ulnar nerve injury which we have already reported it.Materials and Methods: An eight-year-old conscious patient who had weakness, paresthesia and tingling in the right 4th and 5th fingers, as well as right claw hand deformity was evaluated, he had attended once before in 4 months ago due to head trauma in coma state. The child had no clinical and radiological indications of arm or elbow fractures causing nerve compression or entrapment. Elbow malposition had caused ulnar nerve neuropathy during hospitalization. Surgery was attempted, ulnar nerve decompression and anterior transposition done. Results: After three weeks post operatively, active physical therapy was started on the right upper extremity and the hand returned to normal activity after 6 months.Conclusion: In patients with decreased level of consciousness or coma state who need prolonged hospitalization, the limbs must remain in correct position to prevent superficial nerve injuries and neuropathies. Furthermore, careful and scrutinized attention to the traumatic patients and doing on time and targeted imaging, regular follow up of patients, complete and perfect neurological examinations can prevent peripheral nerve injuries or develop on-time treatments which improve the patients' quality of life.

Scheduling Due Dates Assignment with Simultaneous Considerations of Time-Dependent and Position-Dependent Deterioration Effects and Deteriorating Maintenance on a Single Machine

The due date assignment has been popular issues related to the interaction between various participants of the supply chain. In this paper, we investigate single machine due dates assignment scheduling problems with deterioration effects and deteriorating maintenance simultaneously. In the proposed model, the actual processing time of a job is not only dependent on the job's scheduled position, it also depends on the time expended by the jobs already processed. To counteract the deterioration effects of the machine, we assume that at most one maintenance is allowed throughout the scheduling horizon. The common due date assignment model and the slack due date assignment model are examined, respectively. The goal is to determine jointly the optimal due dates, the optimal maintenance position, and the optimal schedule to minimize the total penalty function based on earliness, tardiness and due dates. We show that all the problems studied can be optimally solved in polynomial time algorithms.

An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times

In this paper we consider a multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times by minimizing total weighted tardiness and maximum completion ti...

Pareto Front Based Realistic Soft Real-Time Task Scheduling with Multi-objective Genetic Algorithm on Arbitrary Heterogeneous Multiprocessor System

Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. In this paper, we propose a multi-objective genetic algorithm to solve task scheduling problems with time constraints on arbitrary heterogeneous processors to find the scheduling with minimum makespan and total tardiness. To optimize objectives, we use Pareto front based technique and vector based method. In this problem, just like tasks, we schedule messages on suitable links during the minimization of the makespan and total tardiness. To find a path to transfer a message between processors we use a classic routing algorithm. We compare our method with bubble scheduling and allocation (BSA) method that is a well known algorithm. Experimental results show our method is better than BSA and yields better makespan and total tardiness.

Facing an Uncertain Past

Using my favorite Greek passive-present-neuter participle (I trust you have one, too), I offer a dramatic prolegomenon to this overdue column. To wit, an apology and an explanation for its tardiness. (You’ll notice the potentially unending recursion, since both column and excuses are late.) The apology is easy: we Brits just say "Jolly sorry, actually," and project a pained sincerity, whether we mean it or not.

Single-Machine Scheduling with Due-Date Assignment and Aging Effect under a DeterioratingMaintenance Activity Consideration

This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating maintenance activity consideration simul-taneously. The maintenance activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the maintenance activity has been completed, the machine will revert to its initial condition and the aging effect will start anew, and (2) the machine maintenance duration depends on its starting time. The objective is to find the optimal maintenance position as well as the optimal location of the common due-date for minimizing the total of earliness, tardiness and due-date costs. We introduce a polynomial O(n^4) time solution for the problem. We also present two special cases of the problem and show that they can be optimally solved by a lower order algorithm.

PROGRAM TERAPI ANAK AUTIS DI SLB SEMERANG

The purpose of this study was to describe the programme planning, intervention, and evaluation of the instructional treatment of autistic children. Using the naturalistic qualitative approach, data were collected by interviews, observations, and document analyses. Data were validated by way of the triangulation technique, checking with department friends through discussions and by way of in-depth observation. The data collected were reduced and analysed to yield the research findings. The findings are as follows. The autism treatment programme was carried out through many steps of planning, performance, and evaluation. Autism is an integral part of children who have a special need and special education with service modelling according to their interests, needs, and abilities. Autism is a trouble and tardiness in cognitive, communication, social interaction, and habits. Autism needs a treatment programme that is the same with their education process and everything is given wholly and individually so that they can improve their abilities. Suggestions were given that autism programme be made more effective, the headmaster increase the number of teachers, and cooperation be maximalized between the school and parents.

Membership tardiness

Membership tardiness

Scheduling of AGVs and machines in FMS with makespan criteria using sheep flock heredity algorithm

This paper addresses the problem of simultaneous scheduling of machines and two identical automated guided vehicles (AGVs) in a flexible manufacturing system (FMS) so as to minimize makespan and mean tardiness. For solving this problem, a sheep flock heredity algorithm is proposed. An increase in the performance of the FMS under consideration would be expected as a result of making the scheduling of AGVs an integral part of the overall scheduling activity. For this particular problem, coding has been developed, which gives optimum sequence with makespan value and AGV’S schedule for ten job sets and four layouts. Most of the time, results of sheep flock algorithm are better than other algorithm and traditional methods. Key words: Scheduling, AGVs, FMS.