Mixed graph colouring for unit-time scheduling - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Research Année : 2017

Mixed graph colouring for unit-time scheduling

Résumé

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 graph, where its partial graph without edges represents the union of maximal directed paths and its partial graph without arcs represents the union of maximal cliques. As the problem is known to be NP-hard, both exact and heuristic methods are proposed to solve it. This study is carried out in three steps. First, a new lower and upper bounds for the mixed chromatic number are proposed. Afterwards, a colour-indexed mathematical model using the proposed bounds is developed. Then, a tabu search using a dynamic neighbourhood structure is adapted for solving large instances. Computational experiments conducted on several modified benchmarks show the efficiency and effectiveness of the proposed resolution methods.
Fichier non déposé

Dates et versions

hal-03047101 , version 1 (08-12-2020)

Identifiants

Citer

Ahmed Kouider, Hacène Ait Haddadène, Samia Ourari, Ammar Oulamara. Mixed graph colouring for unit-time scheduling. International Journal of Production Research, 2017, 55 (6), pp.1720-1729. ⟨10.1080/00207543.2016.1224950⟩. ⟨hal-03047101⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More