Search results for " priority"

showing 10 items of 71 documents

Un maître supplémentaire dans la classe. Quels effets sur les progressions au cycle III ?

2004

To try and reduce school achievement discrepancies at primary school, an original set of actions has been conceived and implemented in the area of Haute Marne. The idea is to provide primary schools in Education Priority Areas with an extra teacher, thus making it possible for the "cycle 3" teachers to occasionally split up the class into groups in order to give special attention to underachieving pupils. This article accounts for the results of an evaluation of the effects of this set of actions on the progression of children in French and maths in "cycle 3". The plan of actions, with the present lay out at least, doesn't seem to meet the set targets : the underachieving children dealt wit…

Primary schoolIndividualisationLow achiever[SHS.EDU]Humanities and Social Sciences/Education[SHS.EDU] Humanities and Social Sciences/Education[ SHS.EDU ] Humanities and Social Sciences/EducationAssessmentZone d'éducation prioritaireEnseignement primaireElève en difficultéPlan of actionSchool environmentTraining rateEducational priority areaTaux d'encadrementDispositif pédagogiqueEvaluation
researchProduct

Judicial challenge of collective dismissals: Special reference to workers¿ selection criteria

2021

En el presente estudio se analiza el sistema de impugnación judicial del despido colectivo, con una especial referencia a las cuestiones atinentes a la afectación de los trabajadores, como consecuencia de la aplicación de los conocidos como criterios de selección, así como el juego de las reglas de prioridad de permanencia. Se analizan todas las vías y motivos de impugnación que tienen los trabajadores afectados por el despido colectivo, tanto en la vertiente colectiva como en la individual In this work, the system of judicial challenge forcollective dismissalsis analysed, with a special reference to issues related to affectedworkers, as a consequence of the application of the so-called sel…

Prioridad de permanenciaCollective dismissaDespido colectivoJudicial challengePermanence prioritySelection criteriaImpugnación jurisdiccionalCriterios de selecciónLex Social: Revista de Derechos Sociales
researchProduct

A new list and prioritization of wild plants of socioeconomic interest in Italy: toward a conservation strategy

2021

Wild harvested plants (WHP) and crop wild relatives (CWR), part of the segment of natural diversity that is collectively known as ‘Plant Genetic Resources’, have great socioeconomic importance for humans because they are used either directly or in crop breeding. In order to lay down a solid base for constructing conservation strategies for Italy, an updated annotated list of CWR and WHP was produced for the country including information on known uses. Taxa included in the list were then prioritized using a pragmatic approach based on their value, native status, and need of protection or monitoring.

Prioritizationmedia_common.quotation_subjectBiodiversity010501 environmental sciencesDevelopmentCrop wild relative01 natural sciencesCropGenetic resourcesSocioeconomic statusCWR taxa conservation priority0105 earth and related environmental sciencesmedia_commonbiodiversity2. Zero hungerethnobotanical useRenewable Energy Sustainability and the EnvironmentAgroforestryfungifood and beverages04 agricultural and veterinary sciences15. Life on landGeographyCrop wild relatives040103 agronomy & agriculture0401 agriculture forestry and fisheriesItalian CWR check listhuman activitiesAgronomy and Crop ScienceDiversity (politics)
researchProduct

Ureteral Stones: Shockwave Lithotripsy or Ureteroscopy, Which is Best?

2021

Background Renal stone disease is common and can cause emergency presentation with acute pain due to ureteric colic. International guidelines have stated the need for a multicentre randomised controlled trial (RCT) to determine whether a non-invasive outpatient (shockwave lithotripsy [SWL]) or surgical (ureteroscopy [URS]) intervention should be the first-line treatment for those needing active intervention. This has implications for shaping clinical pathways. Objective To report a pragmatic multicentre non-inferiority RCT comparing SWL with URS. Design, setting, and participants This trial tested for non-inferiority of up to two sessions of SWL compared with URS as initial treatment for ur…

Randomised controlled trialmedicine.medical_specialtyEditorial by Christian Türk Aleš Petřík and Andreas Neisius on pp. 55–56 of this issueUreteral Calculimedicine.diagnostic_testbusiness.industryUrologyGeneral surgeryMEDLINEPlatinum Priority – Stone DiseaseTrialTherapeutic interventions for symptomatic ureteric stonesLithotripsyExtracorporeal shockwave lithotripsyUreteroscopyMedicineHumansUreteroscopybusinessUreteric stonesShockwave lithotripsyEuropean urology
researchProduct

Looking for the best modes helps solving the MRCPSP/max

2013

The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…

Rate-monotonic schedulingEarliest deadline first schedulingMathematical optimizationNurse scheduling problemComputer scienceGenetic algorithm schedulingStrategy and ManagementEvolutionary algorithmDynamic priority schedulingManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingScheduling (computing)International Journal of Production Research
researchProduct

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Rate-monotonic schedulingEarliest deadline first schedulingOptimizationBipartite graphMathematical optimizationOpen-shop schedulingSchedulesDistributed computingComplexity theoryProcessor schedulingDynamic priority schedulingApproximation methodscoupled-tasksFair-share schedulingApproximation algorithmsFixed-priority pre-emptive schedulingNurse scheduling problemTwo-level schedulingMathematics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

An approximate/exact objective based search technique for solving general scheduling problems

2018

Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…

Rate-monotonic schedulingMathematical optimization021103 operations researchSingle-machine schedulingJob shop schedulingComputer science0211 other engineering and technologiesaging effectmetaheuristic02 engineering and technologyDynamic priority schedulingsetup timeFair-share schedulingScheduling (computing)Metaheuristic algorithmsTwo-level scheduling0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingschedulingmaintenance activitySoftwareprecedence constraintsApplied Soft Computing
researchProduct

Two Job Cyclic Scheduling with Incompatibility Constraints

2001

The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.

Rate-monotonic schedulingMathematical optimizationJob shop schedulingComputer scienceStrategy and ManagementDistributed computingFlow shop schedulingDynamic priority schedulingManagement Science and Operations ResearchFair-share schedulingMultiprocessor schedulingComputer Science ApplicationsNurse scheduling problemManagement of Technology and InnovationTwo-level schedulingBusiness and International ManagementComputer Science::Operating Systems
researchProduct

Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres

2012

Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…

Rate-monotonic schedulingService (systems architecture)Information Systems and ManagementPrecedence diagram methodGeneral Computer ScienceOperations researchComputer scienceDistributed computingDynamic priority schedulingSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingFixed-priority pre-emptive schedulingGenetic algorithm schedulingModeling and SimulationTwo-level schedulingEuropean Journal of Operational Research
researchProduct

Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling

2009

Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test for these systems. This paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.

Rate-monotonic schedulingTheoretical computer scienceComputer scienceServerResponse timeDynamic priority schedulingParallel computingTemporal isolationUpper and lower boundsFair-share schedulingScheduling (computing)2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
researchProduct