In this paper we present a decentralized model for scheduling independent tasks in Federated Grids. This model consists in a set of meta-schedulers on each of the grid infrastructures of the Federated Grid. Each meta-scheduler has to implement a mapping strategy in order to improve two of the most common objective functions of tasks scheduling problems: makespan and resource performance. We con...

Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...

In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also desig...

The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due its practical implications in manufacturing systems and emerging new variants, order model optimize more complex situations reflect the current needs of industry better. This work presents metaheuristic algorithm called global-local neighborhood search (GLNSA), which concepts ...

One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makesp...

In confronting the “Memory Wall”, design of embedded vision systems exhibits many challenges regarding cost, energy consumption, and performance. This paper considers a variant Job Shop Scheduling Problem with tooling constraints, arising in this context, which completion time (makespan) is to be minimized. objective corresponds performance produced circuit. We discuss different formulations us...

This paper presents a meta-heuristic algorithm for solving the Flexible Job Shop Scheduling Problem (FJSSP). This strategy, known as Iterative Flattening Search (IFS), iteratively applies a relaxationstep, in which a subset of scheduling decisions are randomly retracted from the current solution; and a solving-step, in which a new solution is incrementally recomputed from this partial schedule....

High-Performance Computing (HPC) systems consume large amounts of energy. As the energy consumption predictions for HPC show increasing numbers, it is important to make users aware of the energy spent for the execution of their applications. Drawing from our experience with exposing cost and performance in public clouds, in this paper we present a generic mechanism to compute fast and accurate ...

The Job Shop Scheduling Problem (JSSP) is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, we develop a three-stage hybrid approach called JSFMA to solve the JSSP. In JSFMA, considering a method similar to Shuffled Frog Leaping algorithm we divide the population in several sub populations an...

This is a summary of the PhD thesis defended by the author in September 2011 at thé Ecole des Mines de Nantes (EMNantes). The thesis was advised by Narendra Jussien (EMNantes) and co-advised by Louis-Martin Rousseau (´ Ecole Polytechnique de Montréal – Poly), Christelle Guéret (EMNantes) and André Langevin (Poly). The manuscript is written in French and can be obtained from The focus of the dis...