104 resultados para Chance-constrained optimisation
Resumo:
The execution of a project requires resources that are generally scarce. Classical approaches to resource allocation assume that the usage of these resources by an individual project activity is constant during the execution of that activity; in practice, however, the project manager may vary resource usage over time within prescribed bounds. This variation gives rise to the project scheduling problem which consists in allocating the scarce resources to the project activities over time such that the project duration is minimized, the total number of resource units allocated equals the prescribed work content of each activity, and various work-content-related constraints are met. We formulate this problem for the first time as a mixed-integer linear program. Our computational results for a standard test set from the literature indicate that this model outperforms the state-of-the-art solution methods for this problem.
Resumo:
Commentary on: Farkouh ME, Domanski M, Sleeper LA, et al. Strategies for multivessel revascularisation in patients with diabetes. N Engl J Med 2012;367:2375–84.
Resumo:
Abstract PURPOSE: In 2003 we reported on the outcomes of 88 patients with node positive disease who underwent radical prostatectomy and pelvic lymph node dissection (median 21 nodes) between 1989 and 1999. Patients with limited nodal disease appeared to have a good chance of long-term survival, even without immediate adjuvant therapy (androgen deprivation therapy and/or radiotherapy). In this study we update the followup in these patients and verify the reported projected probability of survival. MATERIALS AND METHODS: The projected 10-year cancer specific survival probability after the initially reported followup of 3.2 years was 60% for these patients with node positive disease. The outcome has been updated after a median followup of 15.6 years. RESULTS: Of the 39 patients with 1 positive node 7 (18%) remained biochemically relapse-free, 11 (28%) showed biochemical relapse only and 21 (54%) experienced clinical progression. Of these 39 patients 22 (57%) never required deferred androgen deprivation therapy and 12 (31%) died of prostate cancer. All patients with 2 (20) or more than 2 (29) positive nodes experienced biochemical relapse and only 5 (10%) of these 49 experienced no clinical progression. Of these 49 patients 39 (80%) received deferred androgen deprivation therapy. CONCLUSIONS: Biochemical relapse is likely in patients with limited nodal disease after radical prostatectomy and pelvic lymph node dissection, but for 47% of patients this does not imply death from prostate cancer. Patients with 1 positive node have a good (75%) 10-year cancer specific survival probability and a 20% chance of remaining biochemical relapse-free even without immediate adjuvant therapy.
Resumo:
The paper deals with batch scheduling problems in process industries where final products arise from several successive chemical or physical transformations of raw materials using multi–purpose equipment. In batch production mode, the total requirements of intermediate and final products are partitioned into batches. The production start of a batch at a given level requires the availability of all input products. We consider the problem of scheduling the production of given batches such that the makespan is minimized. Constraints like minimum and maximum time lags between successive production levels, sequence–dependent facility setup times, finite intermediate storages, production breaks, and time–varying manpower contribute to the complexity of this problem. We propose a new solution approach using models and methods of resource–constrained project scheduling, which (approximately) solves problems of industrial size within a reasonable amount of time.