“Fiction makes a better job of the truth”: dialogism, oppositional consciousness and re-membering in the novels of Helena María Viramontes

This thesis comprises close textual analyses of Chicana author Helena María Viramontes' two published novels, Under the Feet of Jesus (1995) and Their Dogs Came With Them (2007). These analyses fall under three broad frameworks: space, time and body. Chapter One engages with the first of these frameworks, space, and explores concepts of cognitive mapping and heteroptopias. Chapter Two, which looks at time, employs theories of intertextuality and the palimpsest, while Chapter Three looks at the interrrelationship between mythology and images of the body in the texts. This study emerges five years after the publication of Viramontes' last novel, Their Dogs Came With Them, but offers fresh insight into the contribution of the author to both the Chicano literary tradition and also the U.S. canon through her critique of hegemonic power structures that suppress not only the voices of lower class ethnic citizens but also of ethnic writers. In particular, her work chastises the paucity of attention given to ethnic women writers in the U.S. This thesis reaffirms Viramontes' position as one of the most important writers living and writing in the U.S. today. It corroborates her work as a contestation against ethnic and gender suppression, and applauds the craftsmanship of her narrative style that delicately but decisively exposes the socio-political wrongs that occur in ocntemporary U.S. society.

The effect of involuntary job loss on smoking intensity and relapse.

AIMS: To assess the impact of involuntary job loss due to plant closure or layoff on relapse to smoking and smoking intensity among older workers. DESIGN, PARTICIPANTS, SAMPLE: Data come from the Health and Retirement Study, a nationally representative survey of older Americans aged 51-61 in 1991 followed every 2 years beginning in 1992. The 3052 participants who were working at the initial wave and had any history of smoking comprise the main sample. METHODS: Primary outcomes are smoking relapse at wave 2 (1994) among baseline former smokers, and smoking quantity at wave 2 among baseline current smokers. As reported at the wave 2 follow-up, 6.8% of the sample experienced an involuntary job loss between waves 1 and 2. FINDINGS: Older workers have over two times greater odds of relapse subsequent to involuntary job loss than those who did not. Further, those who were current smokers prior to displacement that did not obtain new employment were found to be smoking more cigarettes, on average, post-job loss. CONCLUSIONS: The stress of job loss, along with other significant changes associated with leaving one's job, which would tend to increase cigarette consumption, must outweigh the financial hardship which would tend to reduce consumption. This highlights job loss as an important health risk factor for older smokers.

Making it in the Modern Job Market: A Study of Communication among the Deaf and Hard of Hearing Population

Gemstone Team AUDIO (Assessing and Understanding Deaf Individuals' Occupations)

Elective double transfer significantly reduce the risk of multiple pregnancy preserving the chances of pregnancy

info:eu-repo/semantics/nonPublished

A greedy open shop heuristic with job priorities

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.

Heuristics for short route job shop scheduling problems

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.

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

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.

Scheduling batches with sequential job processing for two-machine flow and open shops

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.

Scheduling batches with simultaneous job processing for two-machine shop problems

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.

Preemptive scheduling on uniform parallel machines with controllable job processing times

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.

Tied to the job: affective and relational components of nurse retention

Paper investigates whether affective and relational components of nurses' experience of work have a significant impact on their intentions to leave either the job or the nursing profession in models that control for other factors (sociodemographic, work conditions, perceptions of quality of care) that are known to affect career decisions. [Abridged Abstract]

‘Nothing will prevent me from doing a good job’. The professionalisation of part-time teaching staff in further and adult education

Approximately 85,000 part-time teaching staff working in further education (FE) and adult and community learning (ACL) are often seen as ‘a problem’. The intrinsic ‘part-timeness’ of these staff tends to marginalise them: they remain under-recognised and largely unsupported. Yet this picture is over-simplified. This article examines how part-time staff make creative use of professional autonomy and agency to mitigate problematic ‘casual employment’ conditions, reporting on results from Learning and Skills Development Agency-sponsored research (2002–2006) with 700 part-time staff in the learning and skills sector. The question of agency was reported as a key factor in part-time employment. Change is necessary for the professional agency of part-timers to be harnessed as the sector responds to ambitious sectoral ‘improvement’ agendas following the Foster Report and FE White Paper. Enhanced professionalisation for part-time staff needs greater recognition and inclusion in change agendas.