941 resultados para Multiprocessor scheduling with resource sharing


Relevância:

40.00% 40.00%

Publicador:

Resumo:

Despite long-standing calls for patient-focused research on individuals with generalized anxiety spectrum disorder there is little systematized knowledge about the in-session behaviors of these patients. The primary objective of this study was to describe of in-session trajectories of the patients' level of explication (as an indicator of an elaborated exposure of negative emotionality) and the patients' focus on their own resources and how these trajectories are associated with post-treatment outcome. In respect to GAD patients, a high level of explication might be seen as an indicator of successful exposure of avoided negative emotionality during therapy sessions. Observers made minute-by-minute ratings of 1100 minutes of video of 20 patients-therapists dyads. The results indicated that a higher level of explication generally observed at a later stage during the therapy sessions and the patients' focus on competencies at an early stage was highly associated with positive therapy outcome at assessment at post treatment, independent of pretreatment distress, rapid response of well-being and symptom reduction, as well as the therapists' professional experience and therapy lengths. These results will be discussed under the perspective of emotion regulation of patients and therapist's counterregulation. It is assumed that GAD-Patients are especially skilled in masking difficult emotions. Explication level and emotion regulation are important variables for this patient group but there's relation to outcome is different.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper deals with scheduling batch (i.e., discontinuous), continuous, and semicontinuous production in process industries (e.g., chemical, pharmaceutical, or metal casting industries) where intermediate storage facilities and renewable resources (processing units and manpower) of limited capacity have to be observed. First, different storage configurations typical of process industries are discussed. Second, a basic scheduling problem covering the three above production modes is presented. Third, (exact and truncated) branch-and-bound methods for the basic scheduling problem and the special case of batch scheduling are proposed and subjected to an experimental performance analysis. The solution approach presented is flexible and in principle simple, and it can (approximately) solve relatively large problem instances with sufficient accuracy.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the customers’ waiting times is minimized. We show how to model this problem as a resource-constrained project scheduling problem with nonregular objective function, and we present a relaxation-based beam-search solution heuristic. The relaxations are solved by exploiting a duality relationship between temporal scheduling and min-cost network flow problems. This approach has been developed in cooperation with a German automaker. The performance of the heuristic has been evaluated based on practical and randomly generated test instances.