20 resultados para Job training
Resumo:
Computer based mathematical models describing the aircraft evacuation process have a vital role to play in the design and development of safer aircraft, in the implementation of safer and more rigorous certification criteria, cabin crew training and in post mortuum accident investigation. As the risk of personal injury and costs involved in performing large-scale evacuation experiments for the next generation 'Ultra High Capacity Aircraft' (UHCA) are expected to be high, the development and use of these evacuation modelling tools may become essential if these aircraft are to prove a viable reality. In this paper the capabilities and limitations of the airEXODUS evacuation model are described. Its successful application to the prediction of a recent certification trial, prior to the actual trial taking place, is described. Also described is a newly defined parameter known as OPS which can be used as a measure of evacuation trial optimality. In addition, sample evacuation simulations in the presence of fire atmospheres are described. Finally, the data requiremnets of the airEXODUS evacuation model is discussed along with several projects currently underway at the the Univesity of Greenwich designed to obtain this data. Included in this discussion is a description of the AASK - Aircraft Accident Statistics and Knowledge - data base which contains detailed information from aircraft accident survivors.
Resumo:
The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.
Resumo:
We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2.
Resumo:
The paper considers the job shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on one of m⩾2 machines, while the other operation must be performed on a single bottleneck machine, the same for all jobs. For this strongly NP-hard problem we present two heuristics with improved worst-case performance. One of them guarantees a worst-case performance ratio of 3/2. The other algorithm creates a schedule with the makespan that exceeds the largest machine workload by at most the length of the largest operation.
Resumo:
The original concept was to create a 'simulation' which would provide trainee teachers, specializing in Information and Communications Technology (ICT) with the opportunity to explore a primary school environment. Within the simulation, factors affecting the development and implementation of ICT would be modelled so that trainees would be able to develop the skills, knowledge and understanding necessary to identify appropriate strategies to overcome the limitations. To this end, we have developed Allsorts Primary - the prototype of a simulated interactive environment, representing a typical primary school
Resumo:
In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.
Resumo:
We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem.
Resumo:
In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.
Resumo:
This paper gives a general overview of some of the factors involved in the training and knowledge of learning disabilities staff relating to mental health. Early indications from research have shown that training may be effective as a way of addressing these problems, but further research and clear guidance on best practice in implementing staff training are needed in this important area.
Resumo:
This paper discusses the development of provision for the training of teachers in English further and technical education from 1945 to 1956. While these years saw little growth in this provision, they were formative in that the institutional and curricular patterns of teacher training for the diverse fields of technical and further education were developed at this time. The work of the three national centres in Bolton, London and Huddersfield, during the period of the Emergency Training Scheme (ETS) is summarised with particular reference to the influence of the Ministry of Education‟s conditions for ETS colleges and courses. With the ending of the ETS in 1951 the three centres were given permanent status as teacher training colleges which in turn brought them into association with their local universities as constituent colleges of their Area Training Organisations. The consequences of this transfer to the universities for the curriculum and assessment of technical teacher training and the 'policy dichotomy' of teacher training for secondary and technical education are examined.
Resumo:
This paper aims to create a picture of aspects of the working lives of some trainers of technical and further education teachers in a specialist teacher training college in Bolton, Lancashire, from the 1950s to the 1980's. There is little reference to technical teacher training in the literature on teacher training in the second half of the twentieth century. With this gap in mind, this paper sets out to record some memories and impressions of staff involved during these years. Using data from a series of semi-structured interviews, the discussion centres upon their perceptions of their work: of their students, the working environment, the curriculum and their relationships with the technical colleges for whom they were training teachers. The paper has three sections. It begins with a brief discussion of the issues arising from the choice of research methods. The second section contextualises the study and traces the history of Bolton Technical Teachers' Training College from its establishment through to its merger with the Institute of Technology in 1982. This is followed by the presentation and discussion of the interview data.
Resumo:
Study Objective: Work-place violence, harassment and abuse is an increasing feature of nurses’ experience of work in many countries. There is some evidence that the experience of workplace violence affects levels of job satisfaction (Hesketh et al 2003) and career decisions (e.g. Mayer et al 1999, Fernandes et al 1999). This paper reports on verbal and physical abuse by patients, relatives and carers, as well as racial and sexual harassment in Acute Hospitals in London and investigates whether workplace violence affects nurses’ intentions to leave either their current job or the nursing profession, controlling for a number of other factors that are known to affect career decisions, such as workload, pay and own health. Method: A questionnaire designed by two of the authors (Reeves and West) to assess many different aspects of nurses work life was used in a postal survey of nurses grades A to I practising in twenty London acute trusts in 2002. A total of 6,160 clinical nurses were mailed the questionnaires and 2,880 returned completed questionnaires, resulting in an overall response rate of 47%, discounting undelivered questionnaires. Respondents worked in a wide variety of clinical settings but mainly in acute medical and surgical wards. In addition to descriptive statistics, results were analysed using logistic regression with robust standard errors: the appropriate test when the dependent variable is dichotomous and the individual respondents clustered within units (nurses working within hospitals are not statistically independent). Results: Our results show high levels of racial (%), sexual (%) and other, unspecified forms of harassment (%), as well as verbal and physical abuse (14% had been physically assaulted with 5% being assaulted more than once), over the previous 6 months. A very small number (1%) reported experiencing all three forms of harassment; 12% two forms and 29% one form. Only 45% of this sample intended to stay in nursing for at least 3 years; 40% were undecided and 15% intended to leave. Logistic regression estimates showed that reported levels of abuse and harassment had a significant impact on respondents’ career intentions, even in models that controlled for known factors affecting career decisions. About 70% of our respondents reported that they had had too little training in dealing with aggressive behaviour—or none at all—but there was no statistical relationship between lack of training and reported assaults. Conclusions: The international shortage of health care workers is due at least in part to low retention rates. It is crucial to investigate nurses’ experiences of work to identify the factors that shape their career decisions. Workplace violence is increasingly acknowledged as an international, service-wide, health care problem. This paper adds to the literature that shows that workplace violence has an impact on nurses’ career decisions. The implications for managers and policy makers are that strengthening systems of security and providing nurses with training in interpersonal relationships including dealing with aggressive patients could slow nurse turnover.
Resumo:
EXECUTIVE SUMMARY Aims 1. The aims of this strategy are • to ensure that a full range of education and training related to the adult end of life care pathway is available across South East London to meet the needs of our health and social care workforce • to enable those responsible for end of life care education and training commissioning to procure comprehensively from a full range of education providers in a systematic and strategic manner. Background 2. The work that underpins this strategy was begun by the South East London Cancer Network via its Palliative and End of Life Care Coordinating Group and then developed by way of the Marie Curie Delivering Choice Programme’s Education and Training work stream.
Resumo:
The presentation explores and evaluates an innovation in education and training in which two different professional trainings (nursing and social work) are integrated to produce jointly qualified specialist practitioners.