Generalized disjunctive constraint propagation for solving the job shop problem with time lags - Archive ouverte HAL Access content directly
Journal Articles Engineering Applications of Artificial Intelligence Year : 2010

Generalized disjunctive constraint propagation for solving the job shop problem with time lags

Christian Artigues
Marie-José Huguet
Pierre Lopez

Abstract

In this paper we propose new insights based on an insertion heuristic and generalized resource constraint propagation for solving the job shop scheduling problem with minimum and maximum time-lags. To show the contribution of our propositions we propose a branch-and-bound algorithm and provide an experimental study. The results obtained conclude that our heuristic obtains feasible schedules with a better makespan than previous approaches, especially for instances with tightened time lags. The results also prove the interest of the constraint propagation generalization when time lags are considered.
Fichier principal
Vignette du fichier
EAAI-v2_avril2010.pdf (569.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00491986 , version 1 (14-06-2010)

Identifiers

Cite

Christian Artigues, Marie-José Huguet, Pierre Lopez. Generalized disjunctive constraint propagation for solving the job shop problem with time lags. Engineering Applications of Artificial Intelligence, 2010, 24 (2), pp.220-231. ⟨10.1016/j.engappai.2010.07.008⟩. ⟨hal-00491986⟩
153 View
257 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More