Search results for "fair"
showing 10 items of 351 documents
"I RIFLESSI STRATEGICI ORGANIZZATIVI E CONTABILI DEI PRINCIPI CONTABILI INTERNAZIONALI NELLE IMPRESE BANCARIE"
2008
Questo lavoro fornisce una prima ricognizione degli effetti che l’adozione dei principi contabili internazionali da parte delle imprese bancarie ha comportato, da un punto di vista sia strettamente contabile sia organizzativo. In particolare, sono stati oggetto di analisi i principi che disciplinano il trattamento contabile e la disclosure delle voci di bilancio di natura finanziaria, e quindi i principi IAS 32, IAS 39 e IFRS 7. Nella prima parte del lavoro sono state esposte le principali novità introdotte da questi principi, dando particolare rilievo al criterio del fair value ed al diverso trattamento previsto per gli strumenti derivati rispetto alla precedente prassi contabile. Nella se…
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-…
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.
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…
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.
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…
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.
HEURISTIC PROCEDURES FOR GROUP SCHEDULING
1989
ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.
Social Housing and Affordable Rent: The Effectiveness of Legal Thresholds of Rents in Two Italian Metropolitan Cities
2022
Social housing is an instrument of housing policies to support those groups of people who are disadvantaged due to particular economic weaknesses and/or social relational fragility. Consequently, to achieve the objective of social sustainability, the rents of social housing must be below the market rents and low enough to be affordable. Italian law has set several rent thresholds which are based on local territorial agreements between landlords and renters associations. This article aims to examine whether these thresholds generate social fairness and housing affordability within each city and between different cities, or instead inequalities and spatial asymmetries. A cluster analysis is a…