Search results for " Opera"
showing 10 items of 3606 documents
Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules
2021
Abstract The success of warehouse management in a supply chain widely depends on an efficient and effective retrieve of customer orders, which is known as the picking process. This paper investigates various routing policies of pickers under two different allocation methods of items in a warehouse of fixed layout, and evaluates their performance in terms of the resulting travel distance by means of a simulation approach. The allocation strategies taken into account are the random storage and a multi-criteria approach, called Interval-Value TOPSIS (IV-T), which is expressively proposed in this paper as a new way to solve the storage allocation problem of items in a warehouse. Because of the …
Chaotic Properties of Dilute Two and Three Dimensional Random Lorentz Gases II: Open Systems
2000
We calculate the spectrum of Lyapunov exponents for a point particle moving in a random array of fixed hard disk or hard sphere scatterers, i.e. the disordered Lorentz gas, in a generic nonequilibrium situation. In a large system which is finite in at least some directions, and with absorbing boundary conditions, the moving particle escapes the system with probability one. However, there is a set of zero Lebesgue measure of initial phase points for the moving particle, such that escape never occurs. Typically, this set of points forms a fractal repeller, and the Lyapunov spectrum is calculated here for trajectories on this repeller. For this calculation, we need the solution of the recently…
Analysis of the railway network operations safety, with of different obstacles along the route, by the study of Buffon-Laplace type problems: the cas…
2016
In this paper we use an approach based on a Buffon-Laplace type problem for an irregular hexagonal lattice and obstacles to study some problems about analysis of the railway network operations safety in the presence of different obstacles on the route.
I dove e le scene: una lettura geografica delle rappresentazioni spaziali negli allestimenti operistici
2019
Il contributo, muovendo da interessi geografici, intende concentrarsi sulle dinamiche sottese alla rappresentazione dello spazio negli allestimenti scenici di opera lirica. Il melodramma, inteso nella sua accezione di genere più ampia, rappresenta infatti un’espressione artistica che innerva, sostanzia e significa la dimensione culturale occidentale a partire almeno dal tardo Cinquecento. Trovando sintesi felici fra musica, parola e drammatizzazione, l’opera lirica continua oggi a trarre linfa dal cimento delle sue riproduzione e riproposizione in soluzioni sceniche, visioni registiche e allestimenti sempre nuovi. Attraverso il confronto critico fra coppie di allestimenti alternativi di tre…
Value preserving portfolio strategies in continuous-time models
1997
We present a new approach for continuous-time portfolio strategies that relies on the principle of value preservation. This principle was developed by Hellwig (1987) for general economic decision and pricing models. The key idea is that an investor should try to consume only so much of his portfolio return that the future ability of the portfolio should be kept constant over time. This ensures that the portfolio will be a long lasting source of income. We define a continuous-time market setting to apply the idea of Hellwig to securities markets with continuous trading and examine existence (and uniqueness) of value-preserving strategies in some widely used market models. Further, we discuss…
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-…
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…
Rational Solutions to the KdV Equation in Terms of Particular Polynomials
2022
Here, we construct rational solutions to the KdV equation by particular polynomials. We get the solutions in terms of determinants of the order n for any positive integer n, and we call these solutions, solutions of the order n. Therefore, we obtain a very efficient method to get rational solutions to the KdV equation, and we can construct explicit solutions very easily. In the following, we present some solutions until order 10.