Abstract Typically, Graph Coloring Problem (GCP) is one of the key features for graph
stamping in graph theory. The general approach is to paint at least edges, vertices, or the …

This paper presents a historical review and recent developments in mixed graph colorings in
the light of scheduling problems with the makespan criterion. A mixed graph contains both a …

We consider the job shop scheduling problem with unit-time operations and the makespan
criterion. This problem is reduced to finding an optimal colouring of a special class of mixed …

A bi-objective branch-and-bound and an∊-constraint algorithms are proposed for the unit-
time job shop scheduling problem. These two objectives are the minimization of the …

In many industrial problem domains, when faced with a combinatorial optimisation problem,
a “good enough, quick enough” solution to a problem is often required. Simple heuristics …

Les travaux de recherche abordés dans cette thèse portent sur des domaines très connus
dans la recherche opérationnelle qui sont l'ordonnancement d'atelier de production à …

Scheduling is one of the most applicable problems in industry that is considerably studied by
researchers in the recent years. It is necessary to extend the models that can be applied in …

Hyper-heuristics is a collection of search methods for selecting, combining and generating
heuristics used to solve combinatorial optimisation problems. The primary objective of hyper …

Résumé Ce travail porte sur l'étude de deux problèmes d'ordonnancement job shop avec
des opérations dedurée unitaire, où chacun desproblèmes est réduit à un problème de …