A hyper-heuristic ensemble method for static job-shop scheduling.

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyperheuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

Letter: To "My Dear Charles" from John Wesley, January 3, 1741

Digitized from a letter in the Drew University Methodist Collection. 1 Item (2 p.); 17 x 20 cm

Frontiers of the Christian world mission since 1938; essays in honor of Kenneth Scott Latourette. Edited by Wilbur C. Harr.

http://www.archive.org/details/frontiersofthech013243mbp

Slack Stealing Job Admission Control Scheduling

In this paper, we present Slack Stealing Job Admission Control (SSJAC)---a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack stealing algorithm of Thuel et al with an admission control policy to manage the variability in the resource requirements of the periodic tasks. This enables SSJAC to take advantage of the 31\% of utilization that RMS cannot use, as well as any utilization unclaimed by jobs that are not admitted into the system. Using SSJAC, each task in the system is assigned a resource utilization threshold that guarantees the minimal acceptable QoS for that task (expressed as an upper bound on the rate of missed deadlines). Job admission control is used to ensure that (1) only those jobs that will complete by their deadlines are admitted, and (2) tasks do not interfere with each other, thus a job can only monopolize the slack in the system, but not the time guaranteed to jobs of other tasks. We have evaluated SSJAC against RMS and Statistical RMS (SRMS). Ignoring overhead issues, SSJAC consistently provides better performance than RMS in overload, and, in certain conditions, better performance than SRMS. In addition, to evaluate optimality of SSJAC in an absolute sense, we have characterized the performance of SSJAC by comparing it to an inefficient, yet optimal scheduler for task sets with harmonic periods.

Job retention and turnover: a study of child protection and welfare social workers in Ireland

Retaining social workers in child protection and welfare organisations has been identified as a problem in Ireland (McGrath, 2001; Ombudsman for Children, 2006; Houses of the Oireachtas, 2008) and internationally (Ellet et al., 2006; Mor Barak et al., 2006; Tham, 2006). While low levels of retention have been identified, there is no research that examines the factors in Ireland that influence the retention of social workers. In this thesis, data is analysed from qualitative interviews with 45 social workers in the Health Service Executive South about what influences their decisions to stay in or leave child protection and welfare social work. These social workers’ views are examined in relation to quantitative research on the levels of turnover and employment mobility of child protection and welfare social workers employed in the same organisation. Contrary to expectations, the study found that the retention rate of social workers during the period of data collection (March 2005 to December 2006) was high and that the majority of social workers remained positive about this work and their retention. The quality of social workers’ supervision, social supports from colleagues, high levels of autonomy, a commitment to child protection and welfare work, good variety in the work, and a perception that they were making a difference, emerged as important factors in social workers’ decisions to stay. Perceptions of being unsupported by the organisation, which was usually described in terms of high caseloads and demanding workloads, a lack of resources, work with involuntary clients and not being able to make a difference, were the most significant factors in social workers’ decisions to leave and/or to want to leave. Social workers felt particularly professionally unsupported when they received low quality and/or infrequent professional supervision. This thesis critiques the theories of perceived organisational support theory, social exchange theory and job characteristics theory, and uses the concept of ‘professional career’, to help analyse the retention of social workers in child protection and welfare.

“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)

Final Report of the Phase III Archaeological Investigations at the Dr. Upton Scott House (18AP18), Annapolis, Anne Arundel County, Maryland, 1998-1999

In the summers of 1998 and 1999, the Archaeology in Annapolis project carried out archaeological investigation at the eighteenth century Dr. Upton Scott House site (18AP18)located at 4 Shipwright Street in the historic district of Annapolis, Anne Arundel County, Maryland. The Upton Scott House is significant as one of only a few Georgian houses with remnants of its original plantation-inspired landscape still visible (Graham 1998:147). Investigation was completed in agreement with the owners of the historic property, Mr. and Mrs. Paul Christian, who were interested in determining the condition and arrangement of Dr. Upton Scott’s well-documented pleasure gardens. Betty Cosans’ 1972 Archaeological Feasibility Report, the first real archaeological study of the Upton Scott House site, guided the research design and recovery efforts. Cosans determined that testing and survey in the back and side yards of the Scott property would yield important information on the use and history of the property, including that of Scott’s famous gardens. Excavation units and trenches were placed within three separate areas of backyard activity on the site which included Area One: extant brick stables in the southwest of the property; Area Two: the brick foundations of a small outbuilding located in the northwest area of the site; and Area Three: the area of Scott’s formal gardens. The research design included an interest in recovering evidence of African-American spiritual practice and domestic life at the site. Also of significant importance was an analysis of Scott’s garden beds, concerning the order and layout. Also sought was an understanding of the change in perception and use of the backyard by the various owners of the property.

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.