846 resultados para fault-tolerant scheduling
Resumo:
This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.
Resumo:
Most commercial project management software packages include planning methods to devise schedules for resource-constrained projects. As it is proprietary information of the software vendors which planning methods are implemented, the question arises how the software packages differ in quality with respect to their resource-allocation capabilities. We experimentally evaluate the resource-allocation capabilities of eight recent software packages by using 1,560 instances with 30, 60, and 120 activities of the well-known PSPLIB library. In some of the analyzed packages, the user may influence the resource allocation by means of multi-level priority rules, whereas in other packages, only few options can be chosen. We study the impact of various complexity parameters and priority rules on the project duration obtained by the software packages. The results indicate that the resource-allocation capabilities of these packages differ significantly. In general, the relative gap between the packages gets larger with increasing resource scarcity and with increasing number of activities. Moreover, the selection of the priority rule has a considerable impact on the project duration. Surprisingly, when selecting a priority rule in the packages where it is possible, both the mean and the variance of the project duration are in general worse than for the packages which do not offer the selection of a priority rule.
Resumo:
For executing the activities of a project, one or several resources are required, which are in general scarce. Many resource-allocation methods assume that the usage of these resources by an activity is constant during execution; in practice, however, the project manager may vary resource usage by individual activities 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 precedence and various work-content-related constraints are met.
Resumo:
Biodiversity is threatened by agriculture as a whole, and particularly also by traditional methods of agriculture. Knowledge-based agriculture, including GM crops, can reduce this threat in the future. The introduction of no-tillage practices, which are beneficial for soil fertility, has been encouraged by the rapid spread of herbicide-tolerant soybeans in the USA. The replacement of pesticides through Bt crops is advantageous for the non-target insect fauna in test-fields. The results of the British Farm Scale experiment are discussed. Biodiversity differences can mainly be referred to as differences in herbicide application management.
Resumo:
The convergence between the Eurasian and Arabian plates has created a complicated structural setting in the Eastern Turkish high plateau (ETHP), particularly around the Karlıova Triple Junction (KTJ) where the Eurasian, Arabian, and Anatolian plates intersect. This region of interest includes the junction of the North Anatolian Shear Zone (NASZ) and the East Anatolian Shear Zone (EASZ), which forms the northern border of the westwardly extruding Anatolian Scholle and the western boundary of the ETHP, respectively. In this study, we focused on a poorly studied component of the KTJ, the Varto Fault Zone (VFZ), and the adjacent secondary structures, which have complex structural settings. Through integrated analyses of remote sensing and field observations, we identified a widely distributed transpressional zone where the Varto segment of the VFZ forms the most northern boundary. The other segments, namely, the Leylekdağ and Çayçatı segments, are oblique-reverse faults that are significantly defined by uplifted topography along their strikes. The measured 515 and 265 m of cumulative uplifts for Mt. Leylek and Mt. Dodan, respectively, yield a minimum uplift rate of 0.35 mm/a for the last 2.2 Ma. The multi-oriented secondary structures were mostly correlated with “the distributed strike-slip” and “the distributed transpressional” in analogue experiments. The misfits in strike of some of secondary faults between our observations and the experimental results were justified by about 20° to 25° clockwise restoration of all relevant structures that were palaeomagnetically measured to have happened since ~ 2.8 Ma ago. Our detected fault patterns and their true nature are well aligned as being part of a transpressional tectonic setting that supports previously suggested stationary triple junction models.
Resumo:
BACKGROUND Kidney recipients maintaining a prolonged allograft survival in the absence of immunosuppressive drugs and without evidence of rejection are supposed to be exceptional. The ERA-EDTA-DESCARTES working group together with Nantes University launched a European-wide survey to identify new patients, describe them and estimate their frequency for the first time. METHODS Seventeen coordinators distributed a questionnaire in 256 transplant centres and 28 countries in order to report as many 'operationally tolerant' patients (TOL; defined as having a serum creatinine <1.7 mg/dL and proteinuria <1 g/day or g/g creatinine despite at least 1 year without any immunosuppressive drug) and 'almost tolerant' patients (minimally immunosuppressed patients (MIS) receiving low-dose steroids) as possible. We reported their number and the total number of kidney transplants performed at each centre to calculate their frequency. RESULTS One hundred and forty-seven questionnaires were returned and we identified 66 TOL (61 with complete data) and 34 MIS patients. Of the 61 TOL patients, 26 were previously described by the Nantes group and 35 new patients are presented here. Most of them were noncompliant patients. At data collection, 31/35 patients were alive and 22/31 still TOL. For the remaining 9/31, 2 were restarted on immunosuppressive drugs and 7 had rising creatinine of whom 3 resumed dialysis. Considering all patients, 10-year death-censored graft survival post-immunosuppression weaning reached 85% in TOL patients and 100% in MIS patients. With 218 913 kidney recipients surveyed, cumulative incidences of operational tolerance and almost tolerance were estimated at 3 and 1.5 per 10 000 kidney recipients, respectively. CONCLUSIONS In kidney transplantation, operational tolerance and almost tolerance are infrequent findings associated with excellent long-term death-censored graft survival.