GI/M/1 queueing systems with service rates depending on the length of queue
Godunov-like numerical fluxes for conservation laws on networks
We describe a numerical technique for the solution of macroscopic traffic flow models on networks of roads. On individual roads, we consider the standard Lighthill-Whitham-Richards model which is discretized using the discontinuous Galerkin method along with suitable limiters. In order to solve traffic flows on networks, we construct suitable numerical fluxes at junctions based on preferences of the drivers. Numerical experiment comparing different approaches is presented.
Gordon and Newell Queueing Networks and Copulas
G-Réseaux dans un environnement aléatoire
G-Réseaux dans un environnement aléatoire
We study networks with positive and negative customers (or Generalized networks of queues and signals) in a random environment. This environment may change the arrival rates, the routing probabilities, the service rates and also the effect of signals. We prove that the steady-state distribution has a product form. This property is obtained as a corollary of a much more general result on multidimensional Markov chains.
Guarantied Single Disk Access for Very Large Database Files
Guest Editorial
Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming
Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
Heuristic Approach to Train Rescheduling
Heuristic cluster algorithm for multiple facility location-allocation problem
Heuristic methods for the -center problem
Heuristic solving a bicriteria parallel-machine scheduling problem
Heurística complementaria a enfoques duales para la planificación de la producción.
Este trabajo presenta una heurística de varios pasos para la obtención de soluciones admisibles al problema de la planificación de la producción con limitaciones de capacidad, a partir de las soluciones aproximadas que presentan los métodos duales basados en la relajación del problema. La heurística es complementaria a la aplicación de dichos métodos, buscando soluciones admisibles derivadas de las proporcionadas por la solución a la relajación.
Heurísticas de descomposición lagrangiana para algunos problemas de localización discreta.
En este trabajo se considera el Problema de Localización de Plantas Simple y el Problema de la p-Mediana Generalizado. Se construyen dos algoritmos heurísticos, uno para cada problema, basados en una técnica de descomposición lagrangiana para problemas binarios. Los algoritmos son implementados en un microordenador y ejecutados sobre una serie de problemas generados aleatoriamente. Los resultados computacionales son comparados con los de otros dos algoritmos heurísticos basados en la optimización...
Hierarchical control via augmented Lagrangians
How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations
Usual periodic scheduling problems deal with precedence constraints having non-negative latencies. This seems a natural way for modelling scheduling problems, since task delays are generally non-negative quantities. However, in some cases, we need to consider edges latencies that do not only model task latencies, but model other precedence constraints. For instance in register optimisation problems devoted to optimising compilation, a generic machine or processor model can allow considering access...
Hybrid flow-shop with adjustment
The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop:...
Identification of waiting time distribution of M/G/1, M x/G/1, GI r/M/1 queueing systems.
Il rilassamento Lagrangiano in problemi di sequenziamento