Displaying similar documents to “EasyMSG: Tools and techniques for an adaptive overlapping in SPMD programming”

Large neighborhood improvements for solving car sequencing problems

Bertrand Estellon, Frédéric Gardi, Karim Nouioua (2007)

RAIRO - Operations Research

Similarity:

The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness...

Distributed Objects for Parallel Numerical Applications

Francoise Baude, Denis Caromel, David Sagnol (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

The language (pronounced ) was designed and implemented with the aim of importing into parallel and concurrent programming, in the framework of a model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the user writes standard code. The libraries are themselves extensible by the final users, making an open system. Two specific techniques to improve performances of a...

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

A. K. Ojha, Rashmi Ranjan Ota (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Optimization is an important tool widely used in formulation of the mathematical model and design of various decision making problems related to the science and engineering. Generally, the real world problems are occurring in the form of multi-criteria and multi-choice with certain constraints. There is no such single optimal solution exist which could optimize all the objective functions simultaneously. In this paper, -constraint method along with Karush−Kuhn−Tucker (KKT) condition...

On Minimizing Total Tardiness in a Serial Batching Problem

Philippe Baptiste, Antoine Jouglet (2010)

RAIRO - Operations Research

Similarity:

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time occurs. This problem | ∑ is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.