F. Bendali, J. Mailfert, A. Quilliot (2010)
RAIRO - Operations Research
Similarity:
We propose here a pricing Model which is an extension of the Cooperative Game concept and which includes a notion of Elastic Demand. We present some existence results as well as some algorithms. We conclude by discussing this model in the context of some Production and Transportation problems.
A. Vignier, J.-C. Billaut, C. Proust (2010)
RAIRO - Operations Research
Similarity:
A special class of scheduling problems is studied in this paper, named Hybrid Flowshop, jobs have to be performed in a shop and each of them has the same routing (so this is a flowshop). A job consists in different operations. A set of machines are able to perform each operation and this set is called a stage. So when a job consists in two operations, there are two stages in the shop. After introducing the scheduling generalities, we define our preocupations and we propose a notation in...
Alexandre Dolgui, Valery Sysoev (2010)
RAIRO - Operations Research
Similarity:
In this paper, we study a heuristic algorithm for global optimization, which is based on the -transformation. We illustrate its behavior first, on a set of continuous non-convex objective functions – we search the global optimum of each function. Then, we give an example from combinatorial optimization. It concerns the optimization of scheduling rules parameters of a manufacturing system. Computational results are presented, they look encouraging.
Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli (2010)
RAIRO - Operations Research
Similarity:
This paper deals with the problem of scheduling tasks on identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics. ...
Gérard Berthiau, Patrick Siarry (2010)
RAIRO - Operations Research
Similarity:
We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this...
Dominique de Werra, Daniel Kobler (2010)
RAIRO - Operations Research
Similarity:
The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention...
Michel Vasquez, Jin-Kao Hao (2010)
RAIRO - Operations Research
Similarity:
We present, in this article, a hybrid approach for solving the 0–1 multidimensional knapsack problem (MKP). This approach combines linear programming and Tabu search. The resulting algorithm improves on the best result on many well-known hard benchmarks.
M.-L. Levy, P. Lopez, B. Pradin (2010)
RAIRO - Operations Research
Similarity:
We propose a temporal decomposition approach for the one-machine scheduling problem with ready times and due dates. A set of feasible schedules is characterized by means of constraint-based analysis rules. They permit the determination of the feasible locations of each task in a sequence, represented by rank intervals. A decomposition procedure based on comparisons of rank intervals is developed in order to group tasks to be sequenced in the neighbourhood of each other in a feasible...